给你一个由 '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
/**
* @param {character[][]} grid
* @return {number}
*/
var numIslands = function (grid) {
let rows = grid.length
let cols = grid[0].length
let res = 0
for (let i = 0; i < rows; i++) {
for (let j = 0; j < cols; j++) {
if (grid[i][j] == 1) {
res++
dps(grid, i, j, rows, cols)
}
}
}
return res
};
function dps(grid, i, j, rows, cols) {
if (i < 0 || i >= rows || j < 0 || j >= cols) {
return
}
if (grid[i][j] !=1) {
return
}
grid[i][j] = 2
dps(grid, i - 1, j, rows, cols)
dps(grid, i + 1, j, rows, cols)
dps(grid, i, j - 1, rows, cols)
dps(grid, i, j + 1, rows, cols)
}