463. Island Perimeter Difficulty : Easy

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:

算法分析：关键就是找出有几组相邻的陆地，每多出一对总的边数就减少2。

C语言版

int islandPerimeter(int** grid, int gridRowSize, int gridColSize) {
    int i, j, pair = 0, count = 0;
    for(i = 0; i < gridRowSize; i++)
    {
        for(j = 0; j < gridColSize; j++)
        {
            if(grid[i][j] == 1)
            {
                count++;
                if(j + 1 < gridColSize && grid[i][j + 1] == 1) 
                    pair++;
                if(i + 1 < gridRowSize && grid[i + 1][j] == 1)
                    pair++;
            }
        }
    }
    return count * 4 - pair * 2;
}

Python版

class Solution(object):
    def islandPerimeter(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        count = 0; pair = 0
        row = len(grid); col = len(grid[0])
        for i in range(row):
            for j in range(col):
                if grid[i][j] == 1:
                    count += 1
                    if i < row - 1 and grid[i + 1][j] == 1:
                        pair += 1
                    if j < col - 1 and grid[i][j + 1] == 1:
                        pair += 1
        return count * 4 - pair * 2