重点:
(1)岛屿问题的通用解法:DFS/BFS;
(2)遍历的次数就是岛屿的数量;
(3)广搜:递归实现,队列queue实现;
(4)深搜:递归实现,栈stack实现;
难度中等1809
给你一个由 '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'
解析:
这是个网格。首先很容易想到深搜和广搜遍历。那么每次遍历进行标记,遍历的次数就是岛屿的数量。
每次执行遍历,利用visited数组标记已经走过的地方。每次判断条件是:
1)当前位置是岛屿即为1;
2)当前位置没来过visited为0;
3)当前位置合法未出界。
如满足上面三个,那么执行一次搜索,并且岛屿数量+1。
代码:
//递归实现广搜
class Solution {
private:
vector<int> dirx={1,-1,0,0},diry={0,0,1,-1};
int m,n;
void BFS(vector<vector<char>>& grid,int x,int y){
//四个方向
for(int k=0;k<4;k++){
int vx=x+dirx[k];
int vy=y+diry[k];
if(vx>=0&&vy>=0&&vx<m&&vy<n){
//位置合法并且没有被访问过
if(grid[vx][vy]=='1'){
grid[vx][vy]='0';
BFS(grid,vx,vy);
}
}
}
}
public:
int numIslands(vector<vector<char>>& grid) {
m=grid.size();
n=0;
if(m>0)
n=grid[0].size();
int num=0;
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(grid[i][j]=='1'){
num++;
grid[i][j]='0';
BFS(grid,i,j);
}
}
}
return num;
}
};
//递归实现深搜
class Solution {
private:
vector<int> dirx={1,-1,0,0},diry={0,0,1,-1};
int m,n;
void DFS(vector<vector<char>>& grid,int x,int y){
grid[x][y]='0';
if(x+1<m&&grid[x+1][y]=='1')
DFS(grid,x+1,y);
if(x-1>=0&&grid[x-1][y]=='1')
DFS(grid,x-1,y);
if(y+1<n&&grid[x][y+1]=='1')
DFS(grid,x,y+1);
if(y-1>=0&&grid[x][y-1]=='1')
DFS(grid,x,y-1);
}
public:
int numIslands(vector<vector<char>>& grid) {
m=grid.size();
n=0;
if(m>0)
n=grid[0].size();
int num=0;
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(grid[i][j]=='1'){
num++;
grid[i][j]='0';
DFS(grid,i,j);
}
}
}
return num;
}
};