Javascript(JS) 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

思路：

1、遍历矩阵，找到某位置为1，则为岛屿，岛屿数+1

2、从该位置开始深度优先遍历，将与该位置相连的1均变为0（需注意上下左右边界条件判断）

3、继续遍历矩阵至结束，返回岛屿数

var numIslands = function(grid) {
    const row = grid.length
    if(row == 0)    return 0
    const clum = grid[0].length

    let nums = 0 
    for(let i = 0;i < row;i++){
        for(let j = 0;j < clum;j++){
            if(grid[i][j] == '1'){
                nums++
                dfs(grid,i,j)
            }
        }
    }
    return nums
};
function dfs(grid,i,j) {
    const row = grid.length
    const clum = grid[0].length
    grid[i][j] = '0'
    if(i - 1 >= 0 && grid[i - 1][j] == '1') dfs(grid,i - 1,j)
    if(i + 1 <= row - 1 && grid[i + 1][j] == '1') dfs(grid,i + 1,j)
    if(j - 1 >= 0 && grid[i][j - 1] == '1') dfs(grid,i,j - 1)
    if(j + 1 <= clum - 1 && grid[i][j + 1] == '1') dfs(grid,i,j + 1)
}

 时间复杂度：O(MN)

 空间复杂度：O(MN)