【Leetcode-easy-463】Island Perimeter

最新推荐文章于 2020-04-06 10:11:14 发布

LYZ0907

最新推荐文章于 2020-04-06 10:11:14 发布

阅读量763

点赞数 1

分类专栏： Leetcode LeetCode 文章标签：二维数组

本文链接：https://blog.csdn.net/liyazhou0215/article/details/78237155

版权

Leetcode 同时被 2 个专栏收录

50 篇文章 2 订阅

订阅专栏

LeetCode

50 篇文章 1 订阅

订阅专栏

【Leetcode-easy-463】Island Perimeter

题目

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:
这里写图片描述

思路

扩展边界

程序

class Solution {
    public int islandPerimeter(int[][] grid) {

        int[][] newGrid = new int[grid.length+2][grid[0].length+2];

        int perimeter = 0;

        for (int i = 0; i < grid.length; i ++){
            for (int j = 0; j < grid[0].length; j ++){
                newGrid[i+1][j+1] = grid[i][j];               
            }
        }

        for (int i = 1; i < newGrid.length-1; i ++){
            for (int j = 1; j < newGrid[0].length-1; j ++){
                if (newGrid[i][j] == 1){
                    if (newGrid[i-1][j] == 0) perimeter ++;  // 若1的上边是0，则周长加1
                    if (newGrid[i][j+1] == 0) perimeter ++;  // 若1的右边是0，则周长加1 
                    if (newGrid[i+1][j] == 0) perimeter ++;  // 若1的下边是0，则周长加1 
                    if (newGrid[i][j-1] == 0) perimeter ++;  // 若1的左边是0，则周长加1 
                }
            }
        }
        return perimeter;
    }
}