463. Island Perimeter Add to List

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.

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:

//

两个循环上下左右都检查一遍

第一次思考的时候想的是只检查右下，但是发现会重复，

然后又加了左上的判断。

后来仔细想想只对左上判断也是可以的。

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