一、题目描述
以力扣 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
提示:
m == grid.length
n == grid[i].length
1 <= m, n <= 300
grid[i][j]
的值为'0'
或'1'
二、深度优先遍历(DFS)
深度优先遍历通常使用递归沿着一个方向寻找到底,而后再换到别的路径继续搜索。使用深度优先遍历解决上面问题代码如下:
class Solution {
private:
const int dirs[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
public:
void dfs(vector<vector<char>>& grid, int i, int j) {
int m = grid.size();
int n = grid[0].size();
// 陆地修改为海水
grid[i][j] = '0';
for (int d = 0; d < 4; d++) {
int ni = i + dirs[d][0];
int nj = j + dirs[d][1];
// 符合要求的方向继续深度优先遍历
if (ni >= 0 && ni < m && nj >= 0 && nj < n && grid[ni][nj] == '1') {
dfs(grid, ni, nj);
}
}
}
int numIslands(vector<vector<char>>& grid) {
int m = grid.size();
int n = grid[0].size();
int count = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
// 如果是陆地才进行深度优先遍历
if (grid[i][j] == '1') {
// 计数陆地数量
count++;
// 通过深度优先遍历将该区域的陆地全部置为'0'
dfs(grid, i, j);
}
}
}
return count;
}
};
三、广度优先遍历(BFS)
广度优先遍历通常使用队列存储每一层的节点,在下一次循环时遍历新加入队列的这些节点,并继续添加更深一层的节点。使用广度优先遍历解决上面问题代码如下:
class Solution {
public:
int numIslands(vector<vector<char>>& grid) {
const int dirs[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
int m = grid.size();
int n = grid[0].size();
int count = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (grid[i][j] == '1') {
// 将该节点的陆地置为海水
grid[i][j] = '0';
// 计数陆地数量
count++;
// 存储节点用于广度优先遍历的队列
queue<pair<int, int>> q;
q.emplace(i, j);
// 循环添加下一层节点
// 按照广度优先遍历顺序找到邻近的所有陆地节点
while (!q.empty()) {
// 节点出队
auto [r, c] = q.front();
q.pop();
for (int d = 0; d < 4; d++) {
int ni = r + dirs[d][0];
int nj = c + dirs[d][1];
if (ni >= 0 && ni < m && nj >= 0 && nj < n && grid[ni][nj] == '1') {
grid[ni][nj] = '0';
q.emplace(ni, nj);
}
}
}
}
}
}
return count;
}
};