Leetcode 0463. Island Perimeter

You are given `row x col` `grid` representing a map where `grid[i][j] = 1` represents land and `grid[i][j] = 0` represents water. Grid cells are connected horizontally/vertically (not diagonally).

Easy

Description

You are given row x col grid representing a map where grid[i][j] = 1 represents land 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:

Input: grid = [[0,1,0,0],[1,1,1,0],[0,1,0,0],[1,1,0,0]]
Output: 16

• The perimeter is the 16 yellow stripes in the image above.

Example 2:

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

Example 3:

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.

Solution

class Solution {
  public int islandPerimeter(int[][] grid) {
    int row = grid.length;
    int col = grid[0].length;
    int p = 0;
    for (int i = 0; i < row; i++) {
      for (int j = 0; j < col; j++) {
        if (grid[i][j] == 1) {

          // initial perimeter = 4
          p += 4;

          //check connection to the left
          if(j > 0 && grid[i][j - 1] == 1) p -= 1;

          //check connection up
          if(i > 0 && grid[i-1][j] == 1) p -= 1;

          //check connection to the right
          if(j < col - 1 && grid[i][j + 1] == 1) p -= 1;

          //check bottom connection
          if(i < row - 1 && grid[i+1][j] == 1) p -= 1;
        }
      }
    }
    return p;
  }
}