题目描述:
给定一个由 '1'(陆地)和 '0'(水)组成的的二维网格,计算岛屿的数量。一个岛被水包围,并且它是通过水平方向或垂直方向上相邻的陆地连接而成的。你可以假设网格的四个边均被水包围。
示例 1:
输入:
11110
11010
11000
00000输出: 1
示例 2:输入:
11000
11000
00100
00011输出: 3
算法:
BFS,非递归
class Solution {
public:
int numIslands(vector<vector<char>>& grid) {
if(grid.size()==0)
return 0;
vector<vector<int>>visit(grid.size(), vector<int>(grid[0].size()));
int num = 0;
bfs(grid, visit, num);
return num;
}
void bfs(vector<vector<char>>& grid, vector<vector<int>>& visit, int& num)
{
queue<pair<int, int>>q;
for(int m=0; m<grid.size(); m++)
{
for(int n=0; n<grid[0].size(); n++)
{
if(visit[m][n] == 0 && grid[m][n] == '1')
{
num++;
q.push(make_pair(m, n));
visit[m][n] = 1;
while(!q.empty())
{
int i = q.front().first;
int j = q.front().second;
q.pop();
if(i-1>=0 && grid[i-1][j] == '1' && visit[i-1][j]==0) //上边
{
q.push(make_pair(i-1, j));
visit[i-1][j] = 1;
}
if(i+1<grid.size() && grid[i+1][j] == '1' && visit[i+1][j]==0) //下边
{
q.push(make_pair(i+1, j));
visit[i+1][j] = 1;
}
if(j-1>=0 && grid[i][j-1]=='1' && visit[i][j-1] == 0) //左边
{
q.push(make_pair(i, j-1));
visit[i][j-1] = 1;
}
if(j+1<grid[0].size() && grid[i][j+1]=='1' && visit[i][j+1] == 0) //右边
{
q.push(make_pair(i, j+1));
visit[i][j+1] = 1;
}
}
}
}
}
}
};
BFS递归:参考 题解
void bfs(vector<vector<char>>& grid, int x, int y) {
if (x >= 0 && x < grid.size() && y >= 0 && y < grid[0].size() && grid[x][y] == '1') {
grid[x][y] = '0';
bfs(grid, x - 1, y);
bfs(grid, x + 1, y);
bfs(grid, x, y - 1);
bfs(grid, x, y + 1);
}
}
int numIslands(vector<vector<char>>& grid) {
int sum = 0;
for (int i = 0; i < grid.size(); i++) {
for (int j = 0; j < grid[0].size(); j++) {
if (grid[i][j] == '1') {
sum++;
bfs(grid, i, j);
}
}
}
return sum;
}