思路: 依次对所有为‘1’的点进行深度优先搜索,同时借助辅助数组visited对已经搜索过的‘1’进行标记。
class Solution {
public:
int dir[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
vector<vector<bool>>visited;
void dfs(vector<vector<char>>&grid,int x,int y){
visited[x][y]=false;
for(int i=0;i<4;i++){
int new_x=x+dir[i][0];
int new_y=y+dir[i][1];
if(new_x>=0&&new_y>=0&&new_x<grid.size()&&new_y<grid[0].size()&&grid[new_x][new_y]=='1'&&visited[new_x][new_y]){
dfs(grid,new_x,new_y);
}
}
}
int numIslands(vector<vector<char>>& grid){
if(grid.size()==0) return 0;
int m=grid.size();
int n=grid[0].size();
visited.resize(m,vector<bool>(n,true));
int res=0;
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(visited[i][j]&&grid[i][j]=='1'){
res++;
dfs(grid,i,j);
}
}
}
return res;
}
};