LeetCode200. 岛屿数量

思路是基于二叉树深度优先遍历的网格深度优先遍历

//给你一个由 '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'
//
// Related Topics 深度优先搜索 广度优先搜索 并查集 数组 矩阵
// 👍 1236 👎 0


//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int numIslands(char[][] grid) {
        int result = 0;
        for (int i = 0; i < grid.length; i++) {
            for (int j = 0; j < grid[0].length; j++) {
                if (grid[i][j]=='1') {
                    dsfGrid(grid,i,j);
                    result++;
                }
            }
        }
        return result;

    }

    private void dsfGrid(char[][] grid,int row,int col) {
        if (row>=grid.length || col>= grid[0].length||row<0||col<0) {
            return;
        }
        if (grid[row][col]!='1'){
            return;
        }
        grid[row][col] = '2';
        dsfGrid(grid,row-1,col);
        dsfGrid(grid,row+1,col);
        dsfGrid(grid,row,col-1);
        dsfGrid(grid,row,col+1);
    }
}

//leetcode submit region end(Prohibit modification and deletion)