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:

思路：两种思路：直接求周边长，也就是上下左右越界的次数；

class Solution {
    public int islandPerimeter(int[][] grid) {
        if(grid == null || grid.length == 0 || grid[0].length == 0) {
            return 0;
        }
        
        int n = grid.length;
        int m = grid[0].length;
        int count = 0;
        int[] dx = {0,0,-1,1};
        int[] dy = {-1,1,0,0};
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < m; j++) {
                if(grid[i][j] == 1) {
                    for(int k = 0; k < 4; k++) {
                        int ni = i + dx[k];
                        int nj = j + dy[k];
                        if(ni < 0 || ni >= n || nj < 0 || nj >= m || grid[ni][nj] == 0) {
                            count++;
                        }
                    }
                }
            }
        }
        return count;
    }
}

 另外一种：count 1，然后减去相邻的边；怎么count相邻的边，也就是看右边和下边是否是1，左边和上面的count由上面的点已经count过了；4 * count - 2 * neighbor;

class Solution {
    public int islandPerimeter(int[][] grid) {
        int n = grid.length;
        int m = grid[0].length;
        int count = 0;
        int neighbor = 0;
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < m; j++) {
                if(grid[i][j] == 1) {
                    count++;
                    if(i + 1 < n && grid[i + 1][j] == 1) {
                        neighbor++;
                    }
                    if(j + 1 < m && grid[i][j + 1] == 1) {
                        neighbor++;
                    }
                }
            }
        }
        return 4 * count - 2 * neighbor;
    }
}