LeetCode Island Perimeter问题

最新推荐文章于 2022-10-28 18:08:21 发布

-phoenix

最新推荐文章于 2022-10-28 18:08:21 发布

阅读量180

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/m0_37462976/article/details/79083133

版权

算法专栏收录该内容

12 篇文章 0 订阅

订阅专栏

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:

题意就是：给一个矩阵，1代表所选择区域，0代表没有选择的区域。求周长
public static int islandPerimeter(int[][] grid) {
        int allArea = 0;
        for (int i=0;i<grid.length;i++){
            for (int j=0;j<grid[i].length;j++){
                if(grid[i][j]==1){
                    allArea += 4;
                    if (i-1>=0&&j-1>=0&&grid[i][j-1]==1){
                        allArea -= 2;
                    }
                    if (i-1>=0&&j-1>=0&&grid[i-1][j]==1){
                        allArea -= 2;
                    }
                    if(i-1>=0&&j-1<0&&grid[i-1][j]==1){
                        allArea -= 2;
                    }
                    if(j-1>=0&&i-1<0&&grid[i][j-1]==1){
                        allArea -= 2;
                    }
                }
            }
        }
        return allArea;
    }


我的思路就是遍历二维数组的时候将每一个为1的区域的周长计算出来，然后减去多加的边，减去多加的边是遵从当前为1的区域的上方和左方的为1的区域
其实就是减去当前为1的区域上相邻和左相邻的区域，最后得数就是周长