[leetcode] 463. Island Perimeter 解题报告

题目链接: https://leetcode.com/problems/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:

思路: 之前曾经碰到过这题, 用了DFS+hash来做, 非常麻烦, 并且需要大量的空间复杂度, 用来这题上空间会超过限制. 

然后发现其实并不用那么复杂的方法. 只需要计算为1的方格数量和重复的边数即可. 为防止重复计算重合边, 每次只往

回查看, 也就是如果一个方格为1, 只查看左边和上边的方格是否为1.

代码如下:

class Solution {
public:
    int islandPerimeter(vector<vector<int>>& grid) {
        if(grid.size()==0) return 0;
        int cnt = 0, repeat = 0;
        for(int i = 0; i < grid.size(); i++)
        {
            for(int j = 0; j < grid[0].size(); j++)
            {
                if(!grid[i][j]) continue;
                cnt++;
                if(i!=0 && grid[i-1][j]) repeat++;
                if(j!=0 && grid[i][j-1]) repeat++;
            }
        }
        return cnt*4 - repeat*2;
    }
};