点击打开链接
class Solution {
public:
int islandPerimeter(vector<vector<int>>& grid) {
int m= grid.size(), n = grid[0].size();
int sum = 0;
for(int i=0 ; i<m; i++){
for(int j=0; j<n; j++){
if(grid[i][j]){
if(i==0 || grid[i-1][j]==0) sum+=1;
if(i==m-1 || grid[i+1][j]==0) sum+=1;
if(j==0 || grid[i][j-1]==0) sum+=1;
if(j==n-1 || grid[i][j+1]==0) sum+=1;
}
}
}
return sum;
}
};