力扣--＞#剑指Offer 463 . 岛周长

 

class Solution {
    public int islandPerimeter(int[][] grid) {
       int islands = 0, neighbours = 0;

        for (int i = 0; i < grid.length; i++) {
            for (int j = 0; j < grid[i].length; j++) {
                if (grid[i][j] == 1) {
                    islands++; // count islands
                    if (i < grid.length - 1 && grid[i + 1][j] == 1) neighbours++; // count down neighbours
                    if (j < grid[i].length - 1 && grid[i][j + 1] == 1) neighbours++; // count right neighbours
                }
            }
        }

        return islands * 4 - neighbours * 2;
    }
}

1. 遍历矩阵并计算岛屿的数量；
2. 如果当前点是一个岛，计算它是否有右邻或下邻；
3. 结果是岛屿 * 4 - 邻居 * 2

这里的i<grid.length 因为如果不进行i的限制，那么会出现索引超过长度

 

 if (i < grid.length - 1 && grid[i + 1][j] == 1)