463. Island Perimeter
原创
©著作权归作者所有:来自51CTO博客作者wx62ea2466cca9a的原创作品,请联系作者获取转载授权,否则将追究法律责任
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
思路:
两个循环 + 遇到1时考虑四周 +4 - [上,下,左,右]*是否为1。
class Solution {
public int islandPerimeter(int[][] grid) {
if(grid == null || grid.length == 0){
return 0;
}
int cnt = 0;
for(int i = 0 ; i < grid.length; i++){
for(int j = 0; j < grid[0].length ; j++){
if(grid[i][j] == 1) {
cnt += grid[i][j] * 4;
if(i > 0 && grid[i-1][j] == 1)
cnt = cnt - 1;
if(j > 0 && grid[i][j-1] == 1)
cnt = cnt - 1;
if(i < grid.length - 1 && grid[i+1][j] == 1)
cnt = cnt - 1;
if(j < grid[0].length - 1 && grid[i][j+1] == 1)
cnt = cnt - 1;
}
}
}
return