Open larscheng opened 2 months ago
class Solution {
public int numIslands(char[][] grid) {
int count =0;
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length; j++) {
if (grid[i][j]=='1'){
dfs(grid,i,j);
count++;
//遍历岛屿,标记遍历状态
}
}
}
return count;
}
private void dfs(char[][] grid, int i, int j) {
if (i < 0 || i >= grid.length || j < 0 || j >= grid[0].length) {
return;
}
if (grid[i][j]!='1'){
return;
}
grid[i][j]='2';
dfs(grid,i+1,j);
dfs(grid,i-1,j);
dfs(grid,i,j+1);
dfs(grid,i,j-1);
}
}
200. 岛屿数量