从零开始的LC刷题(97): 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:

题意是求小岛的边长（1是小岛的陆地），也就是求黄色部分的长度。我的方法是不用每次都查看上下左右是否有陆地，而是每次只查看左边和右边是否有陆地，用两组if+else if就够了，如果是陆地不计数，不是陆地计数加2。结果：

Success

Runtime: 60 ms, faster than 95.00% of C++ online submissions for Island Perimeter.

Memory Usage: 16.1 MB, less than 100.00% of C++ online submissions for Island Perimeter.

代码：

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