200. 岛屿数量

给你一个由 '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

提示：

• m == grid.length
• n == grid[i].length
• 1 <= m, n <= 300
• grid[i][j] 的值为 '0' 或 '1'

代码展示：

class Solution {
    public int numIslands(char[][] grid ){
        //统计岛屿的数量
        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'){
                    DFS(grid,i,j);
                    count++;
                }
            }
        }
        return count;
    }
    public void DFS(char[][] grid, int r, int c) {
        //行r
        int n = grid.length;
        //列c
        int m = grid[0].length;
        //边界条件递归出口
        if(r >= n || c >= m || r < 0 || c < 0 || grid[r][c] == '0'){
            return ;
        }
        //将遍历过的岛屿设为0
        grid[r][c] = '0';
        //遍历岛屿的前后左右
        DFS(grid,r+1,c);
        DFS(grid,r,c+1);
        DFS(grid,r-1,c);
        DFS(grid,r,c-1);
    }
}

写完这道比较简单的dfs我感觉这种题目需要有这些思想，首先要学会如何去找到本题的递归结束条件，其次是如何避免dfs的循环调用，最后就是如何去理解这个递归的结构，以及它的写法。