463. Island Perimeter [LeetCode]

最新推荐文章于 2022-06-12 10:27:55 发布

chenjieping1995

最新推荐文章于 2022-06-12 10:27:55 发布

阅读量498

点赞数

分类专栏： leetcode算法题 LeetCode算法题

本文链接：https://blog.csdn.net/jacky_chenjp/article/details/54834931

版权

leetcode算法题同时被 2 个专栏收录

23 篇文章 0 订阅

订阅专栏

LeetCode算法题

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

题目要求中心小岛的周长。

根据题意可以提出思路：

遍历二维数组grid：每当读到一个1时，即表示此位置为陆地。周长计数变量count+4，并判断上下左右是否有重合边，如果出现重合，则重合计数变量duplicate+1。最后返回count - duplicate的值即可。

具体的java代码如下：

public class Solution {
    public int islandPerimeter(int[][] grid) {
        if (grid == null || grid.length == 0 || grid[0].length == 0)   return 0;
        int count = 0;
        int duplicate = 0;
        for (int i=0; i