相关标签
一、题目要求
二、题解和代码实现
1.题解
2.代码实现
代码如下(示例):
class Solution {
public int numIslands(char[][] grid) {
int row = grid.length;
int col = grid[0].length;
int count = 0;
for (int i = 0; i < row; i++) {
for (int j = 0; j < col; j++) {
char val = grid[i][j];
if (val=='1'){
dfsIslands(i,j,grid);
count++;
}
}
}
return count;
}
public void dfsIslands(int i,int j,char[][] grid){
if ( i<0 || j<0||i >=grid.length || j >=grid[0].length || grid[i][j]=='0'){
//判断中dfs条件
//前面四个是边界,后面一个是水
return;
}
grid[i][j]='0';//设置为0,沉岛,用于识别已经遍历过的岛屿变为水,以防再次遍历
dfsIslands(i-1,j,grid);//上
dfsIslands(i,j+1,grid);//右
dfsIslands(i+1,j,grid);//下
dfsIslands(i,j-1,grid);//左
}
}