题解 | #岛屿数量#
岛屿数量
http://www.nowcoder.com/practice/0c9664d1554e466aa107d899418e814e
import java.util.*;
public class Solution {
/**
* 判断岛屿数量
* @param grid char字符型二维数组
* @return int整型
*/
public int solve (char[][] grid) {
// write code here
int ans = 0;
for(int i = 0;i<grid.length;i++){
resolve(grid,i,j);
ans++;
}
}
}
return ans;
if(i<0||i>=grid.length||j<0||j>=grid[0].length||grid[i][j]!='1'){
return;
}
grid[i][j] = '2';
resolve(grid,i-1,j);
resolve(grid,i+1,j);
resolve(grid,i,j-1);
resolve(grid,i,j+1);
}
}
public class Solution {
/**
* 判断岛屿数量
* @param grid char字符型二维数组
* @return int整型
*/
public int solve (char[][] grid) {
// write code here
int ans = 0;
for(int i = 0;i<grid.length;i++){
for(int j = 0;j<grid[0].length;j++){
//为字符‘1’的时候则是一个岛屿,然后调用函数将附近的‘1’变成‘2’
if(grid[i][j] == '1'){resolve(grid,i,j);
ans++;
}
}
}
return ans;
}
//将附近的字符‘1’变为‘2’
public void resolve(char[][] grid,int i,int j){if(i<0||i>=grid.length||j<0||j>=grid[0].length||grid[i][j]!='1'){
return;
}
grid[i][j] = '2';
resolve(grid,i-1,j);
resolve(grid,i+1,j);
resolve(grid,i,j-1);
resolve(grid,i,j+1);
}
}