463. Island Perimeter (Easy)

https://leetcode.com/problems/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:

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:

Solutions

class Solution {

    private int computeCoastLine(int[][] grid, int i, int j) {

        // If the grid cell is water, return directly
        if (grid[i][j] == 0) {
            return 0;
        }

        int row = grid.length;
        int col = grid[0].length;

        int len = 0;

        // left is not water or the boundary of the grid
        if ((i - 1 >= 0 && grid[i - 1][j] == 0) || i - 1 < 0) {
            len++;
        }

        if ((i + 1 < row && grid[i + 1][j] == 0) || i + 1 == row) {
            len++;
        }

        if ((j - 1 >= 0 && grid[i][j - 1] == 0) || j - 1 < 0) {
            len++;
        }

        if ((j + 1 < col && grid[i][j + 1] == 0) || j + 1 == col) {
            len++;
        }

        return len;
    }

    public int islandPerimeter(int[][] grid) {
        if (grid == null || grid.length == 0 || grid[0].length == 0) {
            return 0;
        }

        int row = grid.length;
        int col = grid[0].length;

        int ans = 0;

        for (int i = 0; i < row; i++) {
            for (int j = 0; j < col; j++) {
                ans += computeCoastLine(grid, i, j);
            }
        }

        return ans;
    }
}

Incorrect Solutions

References