[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
Explanation: The perimeter is the 16 yellow stripes in the image below:

分析 

这一题给了一个限定条件就是长和宽不会超过100， 那么其实可以使用遍历的方法直接计算得到周长。

用广搜也可以解决这道题，这一题相比于之前遇到的计算岛的面积的题目，唯一的区别在于我们需要知道这个方块的周长，计算的办法很简单，就是看看上下左右是不是1，上下左右有n个1，周长就是4-n。

Code

class Solution {
public:
    int islandPerimeter(vector<vector<int>>& grid) {
        int res = 0;
        int row = grid.size();
        if (row == 0)
            return res;
        int col = grid[0].size();
        
        grid.insert(grid.begin(), vector<int>(col+2, 0));
        grid.push_back(vector<int>(col+2, 0));
        for (int i = 1; i <= row; i ++)
        {
            grid[i].insert(grid[i].begin(), 0);
            grid[i].push_back(0);
        }
        
        int i, j;
        for (i = 1; i <=row; i ++)
        {
            for (j=1; j <=col; j ++)
            {
                if (grid[i][j] == 1)
                {
                    getPerimeter(grid, i, j, res);
                    return res;
                }
            }
        }
        return res;
    }
    
    void getPerimeter(vector<vector<int>>& grid, int i, int j, int& res)
    {
        int row = grid.size();
        int col = grid[0].size();
        if (i <= 0 || j <= 0 || i >= row || j >= col)
            return;
        if (grid[i][j] == 0 || grid[i][j] == 2)
            return;
        
        grid[i][j] = 2;
        int meter = 4;
        if (grid[i-1][j] != 0)
            meter --;
        if (grid[i+1][j] != 0)
            meter --;
        if (grid[i][j+1] != 0)
            meter --;
        if (grid[i][j-1] != 0)
            meter --;
        res += meter;
        getPerimeter(grid, i-1, j, res);
        getPerimeter(grid, i+1, j, res);
        getPerimeter(grid, i, j-1, res);
        getPerimeter(grid, i, j+1, res);
        return;
    }
};