463. Island Perimeter

最新推荐文章于 2022-10-28 18:08:21 发布

fresh_suger

最新推荐文章于 2022-10-28 18:08:21 发布

阅读量269

点赞数

分类专栏： leetcode 文章标签： java leetcode

本文链接：https://blog.csdn.net/ganzhantoulebi0546/article/details/54563474

版权

leetcode 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

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:

这道题就是求图中实心岛的边长，每个小正方形的边长都是1。根据数组：

[[0,1,0,0],
 [1,1,1,0],
 [0,1,0,0],
 [1,1,0,0]]

进行遍历，求数字为1的右侧和下侧是否含有数字1。记录数组中总共出现的1个数num,以及每一个出现的1的右侧和下侧出现1的次数和Perimeter，最后整个岛的边长可以表示为4*num-2*Perimeter。

public class Solution {
        public int islandPerimeter(int[][] grid) {
		int Perimeter = 0;
		int num = 0;
		for(int i = 0;i<grid.length;i++){
			for(int j = 0;j<grid[0].length;j++){
				if(grid[i][j]==1 ){
					num++;
					if(i<grid.length-1&&j<grid[0].length-1&&grid[i+1][j]==1){
						Perimeter++;
					}
					if(i<grid.length-1&&j<grid[0].length-1&&grid[i][j+1]==1){
						Perimeter++;
					}
			     	if(i==grid.length-1&&j<grid[0].length-1&&grid[i][j+1]==1){
						Perimeter++;
					}
					if(j==grid[0].length-1&&i<grid.length-1&&grid[i+1][j]==1){
						Perimeter++;
					}
				}
			}
		}    	
		int ans=num*4-Perimeter*2;
		return ans;       
    } 
}

注意gird[i][j]的范围。一开始一直计算错误，后来发现是grid[][]中超出了范围，还是要认真。