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

 [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:
![image](https://img.haomeiwen.com/i1854651/9a6ebdf0d01c41bd.png?imageMogr2/auto-orient/strip%7CimageView2/2/w/1240)

一刷
题解：
用dfs就可以做，如果周围是陆地，边框--

class Solution {
    int[][] dirs = {{1,0}, {-1,0}, {0,1}, {0,-1}};
    int res = 0;
    int m, n;
    public int islandPerimeter(int[][] grid) {
        if(grid == null || grid.length == 0 || grid[0].length == 0) return 0; 
        m = grid.length;
        n = grid[0].length;
        boolean[][] visited = new boolean[m][n];
        for(int i=0; i<m; i++){
            for(int j=0; j<n; j++){
                if(grid[i][j] == 1){
                    dfs(i, j, grid, visited);
                    return res;
                }
            }
        }
        return res;
    }
    public void dfs(int i, int j, int[][] grid, boolean[][] visited){
        visited[i][j] = true;
        int surround = 4;
        for(int[] dir : dirs){
            int x = i+dir[0];
            int y = j+dir[1];
            if(x>=0 && x<m && y>=0 && y<n && grid[x][y]==1) {
                surround--;
                if(!visited[x][y]){
                    dfs(x, y, grid, visited);
                }
            }
        }
        //System.out.println(i+"/"+j+"/"+surround);
        res+=surround;
    }
    
}