Leetcode——463. Island Perimeter

题目原址

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

解题思路

这个题的意思：给一个二维数组，数组中只有两种数：0和1,0代表海洋，1代表岛屿，这个二维数组中只有一个岛屿，且岛屿是连同的，中间没有海洋。求这个岛屿的周长。一个边的长度为1。

这个题暴力解法就好了啊。判断如果当前的数组元素为1，则判断其前后左右的值是不是为0，如果是，则将边数+1。注意这个二维数组的边缘！！！边缘通过数组下标来控制就可以

AC代码

class Solution {
    public int islandPerimeter(int[][] grid) {
        int length = grid.length;
        if(length == 0)
            return 0;
        int line = grid[0].length;
        int ret = 0;
        for(int i = 0; i < length; i++) {
            for(int j = 0 ; j < line; j++) {
                if(grid[i][j] == 1){
                    if(i == 0 || grid[i-1][j] == 0) ret++;
                    if(i == length - 1 || grid[i+1][j] == 0) ret++;
                    if(j == 0 || grid[i][j-1] == 0) ret++;
                    if(j == line - 1 || grid[i][j + 1] == 0) ret++;                 
                }
            }
        }

        return ret;
    }
}