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:
[[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:
public class Solution {
public int islandPerimeter(int[][] grid) {int res=0;
for(int i=0;i<grid.length;i++){
for(int j=0;j<grid[i].length;j++){
if(grid[i][j]==1){
res+=4;
if(j!=0&&grid[i][j-1]==1)
res-=2;
if(i!=0&&grid[i-1][j]==1)
res-=2;
}
}
}
return res;
}
}
本文介绍了一个算法问题:计算二维网格中岛屿的周长。通过遍历每个单元格并检查相邻的陆地单元格来减少重复计数,最终得出岛屿的总周长。


737

被折叠的 条评论
为什么被折叠?



