463. Island Perimeter*

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:

C++ 实现 1

思路和 892. Surface Area of 3D Shapes* 一致. 当遇到 1 时, 总周长增加 4, 但如果此时前面或者上面也有正方形, 那么重合一次将总周长将减少 2.

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