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:

对于矩阵中为1的元素，只要计算其上下左右元素为0或不存在的位置数量即可

class Solution {
public:
    
    int out(int n,int m,int i,int j){
        if(i<0||i==n||j<0||j==m){ //位置不存在
            return 1;
        }
        return 0;
    }
    
    int islandPerimeter(vector<vector<int>>& grid) {
        int n=grid.size(),i,j,ans=0;
        if(!n){
            return 0;
        }
        int m=grid[0].size();
        for(i=0;i<n;i++){
            for(j=0;j<m;j++){
                if(grid[i][j]==0)continue;
                if(out(n,m,i-1,j)||grid[i-1][j]==0){//上
                    ans++;
                }
                if(out(n,m,i+1,j)||grid[i+1][j]==0){//下
                    ans++;
                }
                if(out(n,m,i,j-1)||grid[i][j-1]==0){//左
                    ans++;
                }
                if(out(n,m,i,j+1)||grid[i][j+1]==0){//右
                    ans++;
                }
            }
        }
        return ans;
    }
};

别人的思路：

只需要计算为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;
    }
};