[leetcode]-463. Island Perimeter（C语言）

最新推荐文章于 2024-11-19 07:15:00 发布

shen_zhu

最新推荐文章于 2024-11-19 07:15:00 发布

阅读量290

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/shen_zhu/article/details/82054581

博客给出一个二维整数网格表示地图，1代表陆地，0代表水，网格被水环绕且只有一个无“湖”的岛屿，需确定该岛屿的周长，还给出了示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

[[0,1,0,0],
 [1,1,1,0],
 [0,1,0,0],
 [1,1,0,0]]

Answer: 16
Explanation: The perimeter is the 16 yellow stripes in the image below:

int islandPerimeter(int** grid, int gridRowSize, int gridColSize) {
    int i,j,lon=0;
    for(i=0;i<gridRowSize;i++)
    {
        for(j=0;j<gridColSize;j++)
        {
            if(grid[i][j]==1)
            {
                lon+=4;
                if(i-1>=0)
                    if(grid[i-1][j]==1)
                        lon--;
                if(i+1<gridRowSize)
                    if(grid[i+1][j]==1)
                        lon--;
                if(j+1<gridColSize)
                    if(grid[i][j+1]==1)
                        lon--;
                if(j-1>=0)
                    if(grid[i][j-1]==1)
                        lon--;
            }
        }
    }
    return lon;
}