方法一:深度优先搜索
class Solution {
private:
int dirs[4][2]={{1,0},{-1,0},{0,1},{0,-1}}; //四个搜索方向
void dfs(vector<vector<char>>& grid,int x,int y){
grid[x][y]='0'; //将访问过的位置标记为0
for(int i=0;i<4;i++){ //分别向四个方向搜索
int nx=x+dirs[i][0],ny=y+dirs[i][1];
if(nx>=0 && nx<grid.size() && ny>=0 && ny<grid[0].size() && grid[nx][ny]=='1')
dfs(grid,nx,ny);
}
public:
int numIslands(vector<vector<char>>& grid) {
int res=0; //返回值
if(grid.empty()) return 0;
for(int i=0;i<grid.size();i++){
for(int j=0;j<grid[0].size();j++){
if(grid[i][j]=='1'){ //遍历数组,如果是陆地,结果加一,再进行dfs
++res;
dfs(grid,i,j);
}
}
}
return res;
}
};
方法二:广度优先搜索
class Solution {
public:
int numIslands(vector<vector<char>>& grid) {
if(grid.empty()) return 0;
int r=grid.size(),c=grid[0].size();
int res=0;
for(int i=0;i<r;i++){ //遍历二维数组
for(int j=0;j<c;j++){
if(grid[i][j]=='1'){ //如果是陆地个数加一,进行广度优先搜索
res++;
queue<pair<int,int>> q; //初始化队列,存放当前结点的所有是陆地的相邻结点
q.push({i,j}); //并将访问过的陆地设为0
while(!q.empty()){
auto top=q.front();
q.pop();
int x=top.first,y=top.second;
if(x-1>=0 && grid[x-1][y]=='1'){
q.push({x-1,y});
grid[x-1][y]='0';
}
if(x+1<r && grid[x+1][y]=='1'){
q.push({x+1,y});
grid[x+1][y]='0';
}
if(y-1>=0 && grid[x][y-1]=='1'){
q.push({x,y-1});
grid[x][y-1]='0';
}
if(y+1<c && grid[x][y+1]=='1'){
q.push({x,y+1});
grid[x][y+1]='0';
}
}
}
}
}
return res;
}
};