leetcode_463. 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:

[[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:

题意：

给定一个二维数组表示一个海岛，二维数组上的数字0表示海水，1表示陆地。每一块陆地的边长为1，假设只有一个岛，求这个岛的周长。

代码：

public class Solution {
    public int islandPerimeter(int[][] grid) {
        int n = grid.length;        //记录二维数组的长度
        int m = grid[0].length;     //记录二维数组的宽度
        int res = 0;                //返回结果
        
        for(int i=0; i<n; i++){     //遍历二维数组
            for(int j=0;j<m;j++){
                res = res + countsideofgrid(grid,i,j,n,m);      //统计岛的周长
            }
        }
       return res; 
    }
    
    public int countsideofgrid(int[][] grid, int i, int j, int n,int m) {    //统计岛的周长的函数，每给一个位置i,j，如果grid[i][j]是1，则表示陆地，初始化返回的周长为4，判断上下左右是否有陆地，如果有，则返回的周长减1
        if(grid[i][j] == 1){
            int count = 4 ;
            if(i-1>=0 && grid[i-1][j] == 1){
                count --;
            }
            if(j-1>=0 && grid[i][j-1] == 1){
                count --;
            }
            if(i+1<n && grid[i+1][j] == 1){
                count --;
            }
            if(j+1<m && grid[i][j+1] == 1){
                count --;
            }
            return count;
        } 
        else {
            return 0;
        }
    }
}

笔记：

这个题刚开始提交超时了，过了几天再提交，就AC了。

思想比较简单，然后时间也比较长。