public class Solution {
public int numIslands(char[][] grid) {
int num = 0;
if (grid == null || grid.length == 0 || grid[0].length == 0) {
return num;
}
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length; j++) {
if (grid[i][j] == '1') {
num++;
helper(grid, i, j);
}
}
}
return num;
}
private void helper(char[][] grid, int i, int j) {
grid[i][j] = 0;
if (i - 1 >= 0 && grid[i - 1][j] == '1') {
helper(grid, i - 1, j);
}
if (j + 1 < grid[0].length && grid[i][j + 1] == '1') {
helper(grid, i, j + 1);
}
if (i + 1 < grid.length && grid[i + 1][j] == '1') {
helper(grid, i + 1, j);
}
if (j - 1 >= 0 && grid[i][j - 1] == '1') {
helper(grid, i, j - 1);
}
}
}
Number of Islands
最新推荐文章于 2022-06-12 16:55:07 发布