Island Perimeter:扫描二维数组，计算边长

最新推荐文章于 2022-01-16 10:55:49 发布

想改名的小雄鹿

最新推荐文章于 2022-01-16 10:55:49 发布

阅读量238

点赞数

分类专栏： Leetcode 文章标签： Java Leecode 二维数组地图

本文链接：https://blog.csdn.net/u013300579/article/details/78736986

版权

Leetcode 专栏收录该内容

188 篇文章 1 订阅

订阅专栏

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:

思路：这是一道找数学规律的题，分别以行、列统计，我们发现，若有一个不与其他相邻的孤岛，边长加2.如果两孤岛相邻，则算作一个孤岛（以行或列角度统计）。

最后将扫描行、扫描列的结果相加。

class Solution {
     public int islandPerimeter(int[][] grid) {
        int sum = 0;
        //boolean first = true;
        boolean hasneighboor = false;
        int n = grid.length;//长
        int m = grid[0].length;//宽
        for(int i = 0;i < n;i++){
        	hasneighboor = false;
        	for(int j = 0;j < m;j++){
                //System.out.println(i+" "+j);
        		if(grid[i][j]==1){
        			if(!hasneighboor){
        				sum +=2;
        				hasneighboor = true;
        			}
        		}else{
        			hasneighboor = false;
        		}
        	}
        }
        for(int i = 0;i < m;i++){
        	hasneighboor = false;
        	for(int j = 0;j < n;j++){
        		if(grid[j][i]==1){
        			if(!hasneighboor){
        				sum +=2;
        				hasneighboor = true;
        			}
        		}else{
        			hasneighboor = false;
        		}
        	}
        }
        return sum;
    }
}