【Leetcode】463. Island Perimeter

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:

Subscribe to see which companies asked this question

题目简述：

二维矩阵中1代表陆地，0代表海洋，矩阵之外的部分默认为海洋。计算海洋与陆地交界部分边长的总和。

思路分析：

首先寻找陆地的一个种子，从这个种子开始向四周遍历。为了避免重复计算，每到一个新地方需要标志一下来过这个地方。

代码：

public class Solution {
    public int islandPerimeter(int[][] grid) {
        if(grid.length==0){
            return 0;
        }
        boolean flag=false;
        int res=0;
        for(int i=0;i<grid.length;i++){
            for(int j=0;j<grid[0].length;j++){
                if(grid[i][j] == 1){
                    res= waterFlow(i,j,grid);
                    flag=true;
                    break;
                }
            }
            if(flag){
                break;
            }
        }
        return res;
    }
    private int waterFlow(int seedLocX,int seedLocY,int[][] grid){
        int sum=0;
        grid[seedLocX][seedLocY]=2;
        
        if(seedLocX-1<0||grid[seedLocX-1][seedLocY]==0){
            sum++;
        }else if(grid[seedLocX-1][seedLocY]==1){
            sum += waterFlow(seedLocX-1,seedLocY,grid);
        }
        
        if(seedLocX+1>=grid.length||grid[seedLocX+1][seedLocY] == 0){
            sum++;
        }else if(grid[seedLocX+1][seedLocY] == 1){
            sum += waterFlow(seedLocX+1,seedLocY,grid);
        }
        
        if(seedLocY-1<0||grid[seedLocX][seedLocY-1] == 0){
            sum++;
        }else if(grid[seedLocX][seedLocY-1] == 1){
            sum += waterFlow(seedLocX,seedLocY-1,grid);
        }
        
        if(seedLocY+1>=grid[0].length||grid[seedLocX][seedLocY+1] == 0){
            sum++;
        }else if(grid[seedLocX][seedLocY+1] == 1){
            sum += waterFlow(seedLocX,seedLocY+1,grid);
        }
        
    return sum;
    }
}

运行结果：