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

[[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）处在小岛紧密包围盒上；2）其对应邻居是水域。所以只要检查每个方格的每一条边，看看是否满足上述两个条件之一即可。

当然本题目也可以用BFS或者DFS来解决，代码可能会更加复杂，但是在水域特别大，小岛特别小，并且已知岛的位置的情况下，效率会更高。

代码：

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