Description

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:

[[0,1,0,0],
[1,1,1,0],
[0,1,0,0],
[1,1,0,0]]

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

islands

Solution

Math, time O(m * n), space O(1)

1. descriptions of this problem implies there may be an “pattern” in calculating the perimeter of the islands.
2. and the pattern is islands * 4 - neighbours * 2, since every adjacent islands made two sides disappeared(as picture below).
3. the next problem is: how to find the neighbours without missing or recounting? i was inspired by the problem: https://leetcode.com/problems/battleships-in-a-board/

class Solution {
    public int islandPerimeter(int[][] grid) {
        if (grid == null || grid.length == 0 || grid[0].length == 0) {
            return 0;
        }
        
        int islands = 0;
        int neighbors = 0;
        
        for (int i = 0; i < grid.length; ++i) {
            for (int j = 0; j < grid[0].length; ++j) {
                if (grid[i][j] == 0) {
                    continue;
                }
                ++islands;
                // count down neighbours
                if (i < grid.length - 1 && grid[i + 1][j] != 0) {
                    ++neighbors;
                }
                // count right neighbours
                if (j < grid[0].length - 1 && grid[i][j + 1] != 0) {
                    ++neighbors;
                }
            }
        }
        
        return 4 * islands - 2 * neighbors;
    }
}