leetcode中等难度题 -- 30.岛屿数量

问题描述

给你一个由 '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. 遍历输入数组，判断当前元素是否表示“陆地”，如果是，以当前元素为起点进行深度优先遍历，并且岛屿数量count+1。

2. 假设当前元素位置为(i, j)，设置位置(i, j)对应的元素为0，避免重复访问，并对该元素的上下左右四个位置做深度遍历。

3. 深度优先遍历结束条件：当前位置超出网格边缘，或者当前位置的元素是0

代码实现（js）

/**
 * @param {character[][]} grid
 * @return {number}
 */
var numIslands = function(grid) {
    let count = 0
    // 遍历
    for(let i = 0; i < grid.length; i++){
        for(let j = 0; j < grid[0].length; j++){
            if(grid[i][j] === '1'){
                // 开始深度遍历
                dfs(grid, i, j)
                count++
            }
        }
    }
    return count;
};
function dfs(grid, row, col){
    if(row < 0 || row >= grid.length || col < 0 || col >= grid[0].length || grid[row][col] === '0'){
        return;
    }
    grid[row][col] = '0'  // 避免之后重复搜索到相同的位置
    dfs(grid, row - 1, col)
    dfs(grid, row + 1, col)
    dfs(grid, row, col - 1)
    dfs(grid, row, col + 1)
}