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

Input:
[[0,1,0,0],
 [1,1,1,0],
 [0,1,0,0],
 [1,1,0,0]]

Output: 16

分析：

给定一个二维数组，1代表陆地，0代表水，要求返回陆地部分的周长。首先遍历数组，若为1，则周长加4。因为会存在重叠的边重复累加的情况，因此从第二列开始，判断同一行相邻列是否都为1，若为1，周长减2；从第二行开始，判断同一列相邻行是否都为1，若为1，周长减2。

class Solution {
public:
    int islandPerimeter(vector<vector<int>>& grid) {
        int res = 0;
        int m = grid.size();
        int n = grid[0].size();
        for(int i = 0; i < m; i++)
        {
            for(int j = 0; j < n; j++)
            {
                if(grid[i][j] == 1)
                    res += 4;
                if(j > 0)
                {
                    if(grid[i][j] && grid[i][j-1])
                        res -= 2;                    
                }
                if(i > 0)
                {
                    if(grid[i][j] && grid[i-1][j])
                        res -= 2;
                }                      
            }
        }
        return res;      
    }
};