LeetCode 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

思路与代码

深度优先搜索
时间复杂度O(mn)
空间复杂度O(mn) 利用了一个辅助的isVisited[][]数组，也可以在原数组上改动，但是有时候不允许对原数组进行修改。递归的深度可能也会达到O(mn)

class Solution {
    public int numIslands(char[][] grid) {
        int row = grid.length;
        int col = grid[0].length;
        int count = 0;

        boolean[][] isVisited = new boolean[row][col];

        for (int i = 0; i < row; i++) {
            for (int j = 0; j < col; j++) {
                if (grid[i][j] == '1' && !isVisited[i][j]) {
                    count++;
                    dfs(grid, isVisited, i, j, row, col);
                }
            }
        }
        return count;
    }

    public void dfs(char[][] grid, boolean[][] isVisited, int i, int j, int row, int col) {
        if (i < 0 || i >= row || j < 0 || j >= col) return;
        if (isVisited[i][j] || grid[i][j] == '0') return;

        isVisited[i][j] = true;

        dfs(grid, isVisited, i-1, j, row, col);
        dfs(grid, isVisited, i+1, j, row, col);
        dfs(grid, isVisited, i, j-1, row, col);
        dfs(grid, isVisited, i, j+1, row, col);

    }
}