以leetcode200题岛屿数量为例,编写BFS和DFS模板
题目如下:
给定一个由 ‘1’(陆地)和 ‘0’(水)组成的的二维网格,计算岛屿的数量。一个岛被水包围,并且它是通过水平方向或垂直方向上相邻的陆地连接而成的。你可以假设网格的四个边均被水包围。
示例 1:
输入:
11110
11010
11000
00000
输出: 1
示例 2:
输入:
11000
11000
00100
00011
输出: 3
BFS模板
class Solution {
public:
vector<pair<int,int>> around = {{0,1}, {0,-1}, {1,0}, {-1,0}};
int numIslands(vector<vector<char>>& grid) {
int numr = grid.size();
if(!numr) return 0;
int numc = grid[0].size();
int step = 0;
for(int i = 0; i < numr;i++){
for(int j = 0; j < numc; j++){
if(grid[i][j] == '1'){
step++;
grid[i][j] = '0';
queue<pair<int, int>> que;
que.push({i,j});
while(!que.empty()){
pair<int,int> temp = que.front();
que.pop();
for(int m = 0; m < 4; m++){
int x = temp.first + around[m].first;
int y = temp.second + around[m].second;
if(x >= 0 && x < numr && y >= 0 && y < numc && grid[x][y] == '1'){
grid[x][y] = '0';
que.push({x,y});
}
}
}
}
}
}
return step;
}
};
DFS模板
class Solution {
public:
void bfs(vector<vector<char>>& grid, int r,int c){
int numR = grid.size();
int numC = grid[0].size();
grid[r][c] = 0;
if(r - 1 >= 0 && grid[r-1][c] == '1')bfs(grid, r - 1, c);
if(r + 1 < numR && grid[r + 1][c] == '1')bfs(grid, r + 1, c);
if(c - 1 >= 0 && grid[r][c-1] == '1')bfs(grid, r, c - 1);
if(c + 1 < numC && grid[r][c+1] == '1')bfs(grid, r, c + 1);
}
int numIslands(vector<vector<char>>& grid) {
int numR = grid.size();
if(!numR){
return 0;
}
int numC = grid[0].size();
int islandCount = 0;
for(int r = 0; r < numR; r++){
for(int c = 0; c < numC; c++){
if(grid[r][c] == '1'){
islandCount++;
bfs(grid,r,c);
}
}
}
return islandCount;
}
};