463. Island Perimeter(easy)

最新推荐文章于 2020-10-30 09:35:59 发布

原创最新推荐文章于 2020-10-30 09:35:59 发布 · 284 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LeetCode刷题练习专栏收录该内容

111 篇文章

订阅专栏

本文介绍了一种算法，用于计算二维网格中岛屿的周长。通过遍历网格，检查每个陆地单元格的四周，确定其边界，从而计算出岛屿的总周长。该算法适用于LeetCode上的岛屿周长问题。

Easy

122889FavoriteShare

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:

Input:

[[0,1,0,0],

[1,1,1,0],

[0,1,0,0],

[1,1,0,0]]

Output: 16

Explanation: The perimeter is the 16 yellow stripes in the image below:

C++:

/*
 * @Autor: SourDumplings
 * @Date: 2019-09-26 19:14:01
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/island-perimeter/
 */

class Solution
{
public:
    int islandPerimeter(vector<vector<int>> &grid)
    {
        int r = grid.size();
        if (r == 0)
        {
            return 0;
        }
        int res = 0;
        int c = grid[0].size();
        for (int i = 0; i < r; i++)
        {
            for (int j = 0; j < c; j++)
            {
                if (grid[i][j] == 0)
                {
                    continue;
                }

                int count = 0;
                // left
                if (j > 0 && grid[i][j - 1] == 1)
                {
                    ++count;
                }
                // right
                if (j < c - 1 && grid[i][j + 1] == 1)
                {
                    ++count;
                }
                // up
                if (i > 0 && grid[i - 1][j] == 1)
                {
                    ++count;
                }
                // down
                if (i < r - 1 && grid[i + 1][j] == 1)
                {
                    ++count;
                }
                res += 4 - count;
            }
        }
        return res;
    }
};

Java:

/*
 * @Autor: SourDumplings
 * @Date: 2019-09-26 20:00:11
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/island-perimeter/
 */

class Solution
{
    public int islandPerimeter(int[][] grid)
    {
        int r = grid.length;
        if (r == 0)
        {
            return 0;
        }
        int res = 0;
        int c = grid[0].length;
        for (int i = 0; i < r; i++)
        {
            for (int j = 0; j < c; j++)
            {
                if (grid[i][j] == 0)
                {
                    continue;
                }

                int count = 0;
                // left
                if (j > 0 && grid[i][j - 1] == 1)
                {
                    ++count;
                }
                // right
                if (j < c - 1 && grid[i][j + 1] == 1)
                {
                    ++count;
                }
                // up
                if (i > 0 && grid[i - 1][j] == 1)
                {
                    ++count;
                }
                // down
                if (i < r - 1 && grid[i + 1][j] == 1)
                {
                    ++count;
                }
                res += 4 - count;
            }
        }
        return res;
    }
}