mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-06 17:44:10 +08:00
40 lines
1.6 KiB
Markdown
Executable File
40 lines
1.6 KiB
Markdown
Executable File
# [463. Island Perimeter](https://leetcode.com/problems/island-perimeter/)
|
||
|
||
## 题目
|
||
|
||
You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water.
|
||
|
||
Grid cells are connected horizontally/vertically (not diagonally). The grid is completely surrounded by water, and there is exactly one island (i.e., one or more connected land cells).
|
||
|
||
The island doesn't have "lakes" (water inside that isn't connected to the water around the island). One cell is a square with side length 1. The grid is rectangular, width and height don't exceed 100. Determine the perimeter of the island.
|
||
|
||
**Example:**
|
||
|
||
Input:
|
||
[[0,1,0,0],
|
||
[1,1,1,0],
|
||
[0,1,0,0],
|
||
[1,1,0,0]]
|
||
|
||
Output: 16
|
||
|
||
Explanation: The perimeter is the 16 yellow stripes in the image below:
|
||
|
||
|
||
|
||
|
||
## 题目大意
|
||
|
||
给定一个包含 0 和 1 的二维网格地图，其中 1 表示陆地 0 表示水域。
|
||
|
||
网格中的格子水平和垂直方向相连（对角线方向不相连）。整个网格被水完全包围，但其中恰好有一个岛屿（或者说，一个或多个表示陆地的格子相连组成的岛屿）。
|
||
|
||
岛屿中没有“湖”（“湖” 指水域在岛屿内部且不和岛屿周围的水相连）。格子是边长为 1 的正方形。网格为长方形，且宽度和高度均不超过 100 。计算这个岛屿的周长。
|
||
|
||
|
||
|
||
## 解题思路
|
||
|
||
- 给出一个二维数组，二维数组中有一些连在一起的 1 ，这是一个岛屿，求这个岛屿的周长。
|
||
- 这是一道水题，判断四周边界的情况依次加一即可。
|