【DFS】封闭岛是指陆地没有和边界相连的岛,也就是我们对不在边界上陆地进行DFS,如果他和边界相连并且边界为陆地,那么就把所有DFS 中经过的点都设置为海洋,意为不符合要求;然后继续对下面的点进行DFS即可。
class Solution {
// dfs
// 12:27 20
int[][] d = new int[][] {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int m, n;
int[][] grid;
public boolean dfs(int x, int y) {
boolean res = true;
for (var i = 0; i < 4; i++) {
int nx = x + d[i][0];
int ny = y + d[i][1];
if (nx >= 0 && nx < m && ny >= 0 && ny < n && grid[nx][ny] == 0) {
// 如果边界为土地,说明不是封闭的,将结果变为false
if ((nx == 0 || nx== m - 1 || ny == 0 || ny == n - 1)) res &= false; // 注意不要直接return false,要把所有和他相连的土地都标记上,因为这些地方都与边界相连
grid[nx][ny] = 1;
res &= dfs(nx, ny);
}
}
return res;
}
public int closedIsland(int[][] grid) {
m = grid.length;
n = grid[0].length;
this.grid = grid;
int ans = 0;
for (var i = 1; i < m - 1; i++) {
for (var j = 1; j < n - 1; j++) {
// 对每一个不在边界上的土地进行dfs,用来验证是否边界为土地并且标记所有和他相连的土地
if (grid[i][j] == 0) {
grid[i][j] = 1;
if (dfs(i, j)) ans++;
}
}
}
return ans;
}
}
【BFS】
class Solution {
// bfs
// 7:08 30
int[][] grid;
int[][] d = new int[][] {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int m, n;
boolean bfs(int x,int y) {
Queue<int[]> queue = new LinkedList();
queue.offer(new int[] {x, y});
grid[x][y] = 1;
boolean res = true;
while(!queue.isEmpty()) {
int[] top = queue.poll();
for (var i = 0; i < 4; i++) {
int nx = top[0] + d[i][0];
int ny = top[1] + d[i][1];
if (nx >= 0 && nx < m && ny >= 0 && ny < n && grid[nx][ny] == 0) {
if (nx == 0 || nx == m - 1 || ny == 0 || ny == n - 1) {
res &= false;
}
grid[nx][ny] = 1;
queue.offer(new int[] {nx, ny});
}
}
}
return res;
}
public int closedIsland(int[][] grid) {
m = grid.length;
n = grid[0].length;
int ans = 0;
this.grid = grid;
for (var i = 1; i < m - 1; i++) {
for (var j = 1; j < n - 1; j++) {
if (grid[i][j] == 0) {
if (bfs(i, j)) {
ans++;
// System.out.println(i + " " + j);
}
}
}
}
return ans;
}
}