22.leetCode463: 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:

题意：给定二维的地图，1表示岛，0表示水，岛和岛之间是横向或纵向连接的而不会对角线连接。计算相连的岛的总周长

思路一：遍历二维数组中的每一个元素，判断每一个元素的四周有多少个0，有多少个0周长就加多少。对于处于边(i=0或j=0)上的元素，只要i<0或j<0，周长也加1.

代码：

class Solution {
    public int islandPerimeter(int[][] grid) {
        int[] di = {-1,0,1,0};
        int[] dj = {0,-1,0,1};
        int row = grid.length;
        int col = grid[0].length;
        int total = 0;
        for(int i=0;i<row;i++){
            for(int j=0;j<col;j++){
                if(grid[i][j]==1)
                    for(int m=0;m<4;m++)
                        if(i+di[m]<0 || i+di[m]>=row || j+dj[m]<0 ||j+dj[m]>=col)
                            total++;
                        else if(grid[i+di[m]][j+dj[m]]==0)
                            total++;
            }
        }
        return total;
    }
}

运行时间：209ms

思路二：遍历二维数组中的每一个元素，对于不处于第一列(i=0)上的元素m，若m为1，周长数加4，则再判断m的左边和上边是否为1，若为1，则表明有岛与其相连，周长数需要减2.

代码：

class Solution {
    public int islandPerimeter(int[][] grid) {
        int row = grid.length;
        int col = grid[0].length;
        int total = 0;
        for(int i=0;i<row;i++){
            for(int j=0;j<col;j++){
                if(grid[i][j]==1){
                    total = total + 4;
                    if(i>0 && grid[i-1][j]==1)
                        total = total -2;
                    if(j>0 && grid[i][j-1]==1)
                        total = total -2;
            }
            }
        }
        return total;
    }
}

运行时间：191ms

思路三：遍历二维数组中的每个元素m，判断m的右边和下边有没有相邻的岛。总的周长等于4*岛数-2*相邻的岛数

public 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;
    }
}

运行时间：129ms

问题：为何思路二比思路三慢了很多？