200. 岛屿数量
思路:
深度优先遍历即可。
class Solution {
public:
void dfs(vector<vector<char>>& grid,int i,int j,int n,int m){
if(i<0 || i>=n || j<0 || j>=m || grid[i][j]!='1') return;
grid[i][j]='2';
dfs(grid,i-1,j,n,m);//向上
dfs(grid,i+1,j,n,m);//向上
dfs(grid,i,j-1,n,m);//向左
dfs(grid,i,j+1,n,m);//向右
}
int numIslands(vector<vector<char>>& grid) {
int num=0;int n=grid.size(),m=grid[0].size();
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(grid[i][j]=='1'){
num++;
dfs(grid,i,j,n,m);
}
}
}
return num;
}
};