LeetCode 热题100-59-岛屿数量

核心思想：dfs
思路：可以看本账号第一篇博客，讲解dfs和bfs很清楚。
dfs和bfs讲解传送门

class Solution {
    int[][] dir = {{-1,0},{1,0},{0,-1},{0,1}};
    int count = 0;

    public int numIslands(char[][] grid) {
        boolean[][] sign = new boolean[grid.length][grid[0].length];
        solve(grid, sign);
        return count;
    }

    public void solve(char[][] grid, boolean[][] sign){
        for(int i = 0; i < grid.length; i++){
            for(int j = 0; j < grid[0].length; j++){
                if(grid[i][j] == '1' && sign[i][j] == false){
                    sign[i][j] = true;
                    dfs(grid, sign, i, j);
                    count++;
                }
            }
        }
    }

    public void dfs(char[][] grid, boolean[][] sign, int beginX, int beginY){
        for(int i = 0; i < 4; i++){
            int newX = beginX + dir[i][0];
            int newY = beginY + dir[i][1];
            if(newX >= 0 && newX < grid.length && newY >= 0 && newY < grid[0].length 
            && grid[newX][newY] == '1' && sign[newX][newY] == false){
                sign[newX][newY] = true;
                dfs(grid, sign, newX, newY);
            }
        }
    }
}