LeetCode 463. Island Perimeter(Java)

原题：
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:

---

题意：
该题的大致题意就是求小岛的周长，给定的数组中，其中1表示陆地，0表示海洋。

---

思路：
1.遍历数组，如果是1则加上4（四条边）；
2.如果该位置是1并且它的左边是1的话，那么就抵消了两条边，则减2；
3.如果该位置是1并且它的上边是1的话，那么就抵消了两条边，则减2；
4.返回周长即可。

---

代码：

public class Solution {
    public int islandPerimeter(int[][] grid) {
        int count = 0;//record the value of the answer
        for(int i = 0;i < grid.length;i++){
            for(int j = 0;j < grid[0].length;j++){
                if(grid[i][j] == 1){
                    count += 4;
                }
                if(grid[i][j] == 1 && i - 1 >= 0 && grid[i - 1][j] == 1){
                    count -= 2;
                }
                if(grid[i][j] == 1 && j - 1 >= 0 && grid[i][j - 1] == 1){
                    count -= 2;
                }
            }
        }
        return count;
    }
}