Island Perimeter Problem


Description

LeetCode Problem 463.

You are given row x col grid representing a map where grid[i][j] = 1 representsland and grid[i][j] = 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”, meaning the water inside 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 1:

1
2
3
Input: grid = [[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 above.

Example 2:

1
2
Input: grid = [[1]]
Output: 4

Example 3:

1
2
Input: grid = [[1,0]]
Output: 4

Constraints:

  • row == grid.length
  • col == grid[i].length
  • 1 <= row, col <= 100
  • grid[i][j] is 0 or 1.
  • There is exactly one island in grid.


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
class Solution {
public:
    int islandPerimeter(vector<vector<int>>& grid) {
        if (grid.size() == 0)
            return 0;
        int r = grid.size();
        int c = grid[0].size();
        
        int perim = 0;
        for (int i = 0; i < r; i ++) {
            for  (int j = 0; j < c; j ++) {
                if (grid[i][j] == 1) {
                    if ((i == 0) || (grid[i-1][j] == 0))
                        perim ++;
                    if ((i == r-1) || (grid[i+1][j] == 0))
                        perim ++;
                    if ((j == 0) || (grid[i][j-1] == 0))
                        perim ++;
                    if ((j == c-1) || (grid[i][j+1] == 0))
                        perim ++;
                }
            }
        }
        
        return perim;
    }
};




Related Posts

Transpose Matrix Problem

LeetCode 867. Given a 2D integer array matrix, return the...

Spiral Matrix III Problem

LeetCode 885. You start at the cell (rStart, cStart) of...

Minimize Malware Spread II Problem

LeetCode 928. You are given a network of n nodes...

Max Increase To Keep City Skyline Problem

LeetCode 807. There is a city composed of n x...

Making A Large Island Problem

LeetCode 827. You are given an n x n binary...

Image Overlap Problem

LeetCode 835. You are given two images, img1 and img2,...