[leetcode 463]Island Perimeter

最新推荐文章于 2026-02-28 21:32:41 发布

原创最新推荐文章于 2026-02-28 21:32:41 发布 · 587 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode #463 #Island Perimeter

Leetcode 专栏收录该内容

42 篇文章

订阅专栏

本文介绍了一个算法问题，即计算二维网格中岛屿的周长。通过遍历网格并统计每个陆地单元格周围的水域数量来计算总周长。

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:

AC代码：

public class Solution {
    public static int islandPerimeter(int[][] grid) {
        int rows = grid.length;
        if(rows == 0){
            return 0;
        }
        int columns = grid[0].length;

        int[][] cnt = new int[rows][columns];

        int all = 0;

        int allOfOne = 0;

        for(int i = 0; i < rows ; ++i){
            for(int j = 0; j < columns ; ++j){
                if(grid[i][j] == 1){
                    ++ allOfOne;
                    if(i-1 >=0 && grid[i-1][j] == 1 && cnt[i-1][j] == 1){
                        ++all;
                    }
                    if(i+1 < rows && grid[i+1][j] == 1 && cnt[i+1][j] == 1){
                        ++all;
                    }
                    if(j-1 >=0 && grid[i][j-1] ==1 && cnt[i][j-1] ==1){
                        ++all;
                    }
                    if(j+1 < columns && grid[i][j+1] == 1 && cnt[i][j+1] ==1){
                        ++all;
                    }
                    cnt[i][j] = 1;
                }
            }
        }
        return (allOfOne << 2) - (all << 1);
    }
}

更多leetcode题解：更多leetcode题解查看