LeetCode：Island Perimeter - 岛屿周长

最新推荐文章于 2024-09-27 23:11:53 发布

csdn产品小助手

最新推荐文章于 2024-09-27 23:11:53 发布

阅读量101

点赞数

文章标签：数据结构与算法 python java

原文链接：https://my.oschina.net/Tsybius2014/blog/1543469

版权

2019独角兽企业重金招聘Python工程师标准>>>

1、题目名称

Island Perimeter（岛屿周长）

2、题目地址

https://leetcode.com/problems/island-perimeter/description/

3、题目内容

英文：

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:

中文：

用一个二维数组表示一片水域，0代表水，1代表陆地，求水域中岛屿的周长。

4、解题方法

考察二维数组的每个元素，如果该元素为陆地，再考察其上下左右四个方向，如果在某一方向未与其他陆地接壤，则周长加一。

/**
 * LeetCode 463 - Island Perimeter
 * @文件名称 Solution.java
 * @文件作者 Tsybius2014
 * @创建时间 2017年9月26日10:30:40
 */
class Solution {

    /**
     * 计算岛屿周长
     * @param grid
     * @return
     */
    public int islandPerimeter(int[][] grid) {
        
        if (grid.length == 0 || grid[0].length == 0) {
            return 0;
        }
        
        int perimeter = 0;
        for (int i = 0; i < grid.length; i++) {
            for (int j = 0; j < grid[i].length; j++) {
                if (grid[i][j] == 1) {
                    if (i == 0 || grid[i - 1][j] == 0) {
                        perimeter++;
                    }
                    if (i == grid.length - 1 || grid[i + 1][j] == 0) {
                        perimeter++;
                    }
                    if (j == 0 || grid[i][j - 1] == 0) {
                        perimeter++;
                    }
                    if (j == grid[0].length - 1 || grid[i][j + 1] == 0) {
                        perimeter++;
                    }
                }
            }
        }
        
        return perimeter;
    }
}

END

转载于:https://my.oschina.net/Tsybius2014/blog/1543469