[LC]463. 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:

[[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:

二、我的思路

对每一个块进行处理，分上下左右四个方向。相邻的块是0或者是边界是一样的。

class Solution {
    public int islandPerimeter(int[][] grid) {
        int p = 0;
        if(grid.length == 0){
            return 0;
        }
        for(int i = 0; i < grid.length; i ++){
            for(int j = 0; j < grid[0].length; j ++){
                if(grid[i][j] == 1){
                    // upper
                    if(i == 0 || grid[i-1][j] == 0){
                        p ++;
                    }
                    // lower
                    if(i == grid.length-1 || grid[i+1][j] == 0){
                        p++;
                    }
                    // left
                    if(j == 0 || grid[i][j-1] == 0){
                        p ++;
                    }
                    //right
                    if(j == grid[0].length-1 || grid[i][j+1] == 0){
                        p ++;
                    }
                }
            }
        }
        return p;
    }
}

感觉很多是重复计算的……

三、淫奇技巧

以下摘自LC的@liupangzi：

1. loop over the matrix and count the number of islands;
2. if the current dot is an island, count if it has any right neighbour or down neighbour;
3. the result is islands * 4 - neighbours * 2

“

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/

+--+     +--+                   +--+--+
|  |  +  |  |          ->       |     |
+--+     +--+                   +--+--+

4 + 4 - ? = 6  -> ? = 2

”

用数学方法解决问题才是王道吖。。原理：两个连在一起的陆地损失两条边。。

public class Solution {
    public int islandPerimeter(int[][] grid) {
        int islands = 0, neighbours = 0;

        for (int i = 0; i < grid.length; i++) {
            for (int j = 0; j < grid[i].length; j++) {
                if (grid[i][j] == 1) {
                    islands++; // count islands
                    if (i < grid.length - 1 && grid[i + 1][j] == 1) neighbours++; // count down neighbours
                    if (j < grid[i].length - 1 && grid[i][j + 1] == 1) neighbours++; // count right neighbours
                }
            }
        }

        return islands * 4 - neighbours * 2;
    }
}

四、举一反三

1. 如果有lake？这种方法依然可行。

2. 如果不止一块陆地？这种方法依然可行。

3. 多块陆地求最大面积？待解。。

4. 多块陆地求最大边长？待解。。

五、碎碎念

不能躲避的还是要早点积极面对，比如刷题。。