463. Island Perimeter(easy)

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: [email protected]
 * @Description: https://leetcode.com/problems/island-perimeter/
 */

class Solution
{
public:
    int islandPerimeter(vector> &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: [email protected]
 * @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;
    }
}