力扣--岛屿数量200（DFS深度优先搜索）

        给你一个由 '1'（陆地）和 '0'（水）组成的的二维网格，请你计算网格中岛屿的数量。

岛屿总是被水包围，并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。

此外，你可以假设该网格的四条边均被水包围。

示例 1：

输入：grid = [
  ["1","1","1","1","0"],
  ["1","1","0","1","0"],
  ["1","1","0","0","0"],
  ["0","0","0","0","0"]
]
输出：1

示例 2：

输入：grid = [
  ["1","1","0","0","0"],
  ["1","1","0","0","0"],
  ["0","0","1","0","0"],
  ["0","0","0","1","1"]
]
输出：3

class Solution {
    public int numIslands(char[][] grid) {
         int n = grid.length;//行数
        int m = grid[0].length;//列数
        int num = 0;//记录岛屿数
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (grid[i][j] == '1') {//判断是否是岛屿
                    dfs(grid,i,j);//查找该岛屿的剩余部分
                       num++;
                }
            }
        }
        return num;
    }

 private static void dfs(char[][] grid,int i,int j) {
        if(i<0||j<0||i>= grid.length||j>=grid[0].length){//超出边界
            return;
        }
        if(grid[i][j]=='1'){//查看是否还符合条件
            grid[i][j]='0';//把已经遍历过的岛屿改成海
            dfs(grid, i, j-1);//遍历其上下左右
            dfs(grid, i, j+1);
            dfs(grid, i-1, j);
            dfs(grid, i+1, j);
        }
    }
}