463. Island Perimeter

最新推荐文章于 2019-11-22 08:53:09 发布

myfwjy

最新推荐文章于 2019-11-22 08:53:09 发布

阅读量201

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/myfwjy/article/details/53307408

版权

LeetCode 专栏收录该内容

91 篇文章 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:

思路：

如果有土地，只要判断他的上下左右是否有土地，即可知道边长是多少。

public class Solution {
    public int islandPerimeter(int[][] grid) {
	int sum = 0;
	int side = 4;
	if (grid == null || grid.length == 0)
		return sum;
	for (int i = 0; i < grid.length; i++) {
		for (int j = 0; j < grid[0].length; j++) {
			if (grid[i][j] == 0) {
				continue;
			}
			side = 4;
			if (i > 0 && grid[i - 1][j] == 1) {
				side--;
			}
			if (j > 0 && grid[i][j - 1] == 1) {
				side--;
			}
			if (j <= grid[0].length - 2 && grid[i][j + 1] == 1) {
				side--;
			}
			if (i <= grid.length - 2 && grid[i + 1][j] == 1) {
				side--;
			}
			sum += side;
		}
	}
	return sum;        
    }
}