【算法】----DFS（深度优先遍历）解决小岛个数问题

问题：
Given a 2d grid map of '1’s (land) and '0’s (water), count the number of islands. An island is surrounded by water
and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

问题翻译：1表示土地，0表示海水，1连成一片为一座小岛，统计有多少小岛？

Example 1:

Input:
11110
11010
11000
00000

Output: 1

---

Example 2:

Input:
11000
11000
00100
00011

Output: 3

---

算法：

 private static int sumIsland(char[][] grid){
        //参数效验
        if (grid==null||grid.length==0||grid[0].length==0){
            return 0;
        }
        // 
        int count=0; // 统计小岛数量
        for (int i=0;i<grid.length;i++){
            for (int j=0;j<grid[0].length;j++){
                if (grid[i][j]=='1'){  //第一次遍历到，小岛数量+1
                    count++;
                    dfs(grid,i,j);  // dfs深度遍历
                }
            }
        }
        return count;
    }

    private static void dfs(char[][] grid,int x,int y){
        if (x<0||y<0||x==grid.length||y==grid[0].length||grid[x][y]=='0'||grid[x][y]=='x'){ //如果行或列不合法，或者是海水，或者是已经遍历过，则直接返回
            return;
        }

        if (grid[x][y]=='1')
            grid[x][y]='x'; //第一次遍历到，修改参数，标记已经遍历过

        dfs(grid,x-1,y); //向上遍历
        dfs(grid,x+1,y); //向下遍历
        dfs(grid,x,y-1); //向左遍历
        dfs(grid,x,y+1); //向右遍历
    }


    public static void main(String[] args) {

        char[][] grid={{'1','1','1','1'},
                       {'1','0','1','0'},
                       {'0','1','0','1'},
                       {'0','1','0','1'}};

        System.out.println("小岛的个数为："+sumIsland(grid));

    }