给你一个由 '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
为了避免重复,重要思想是计算后淹没整个岛屿
// 这段代码实现了一个深度优先搜索(DFS)算法来统计二维网格中岛屿的数量。
public int numIslands(char[][] grid) {
int res = 0; // 记录找到的岛屿数量
// 外层循环遍历二维网格的行
for (int i = 0; i < grid.length; i++) {
// 内层循环遍历二维网格的列
for (int j = 0; j < grid[0].length; j++) {
// 如果当前位置为陆地(即值为 '1'),则执行以下操作:
if (grid[i][j] == '1') {
// 岛屿数量加一
res++;
// 调用深度优先搜索方法 dfs,开始淹没当前岛屿
dfs(grid, i, j);
}
}
}
// 返回找到的岛屿数量
return res;
}
// 深度优先搜索方法 dfs
public void dfs(char[][] grid, int i, int j) {
// 搜索边界:索引越界或遍历到了水域(值为 '0')
if (i < 0 || i >= grid.length || j < 0 || j >= grid[0].length || grid[i][j] == '0') {
return;
}
// 将当前位置标记为已访问过,即淹没当前岛屿
grid[i][j] = '0';
// 对当前位置的上、下、左、右四个相邻顶点进行深度优先搜索
dfs(grid, i - 1, j);
dfs(grid, i + 1, j);
dfs(grid, i, j + 1);
dfs(grid, i, j - 1);
}