-
Notifications
You must be signed in to change notification settings - Fork 54
/
Solution.java
49 lines (44 loc) · 1.34 KB
/
Solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
package g1201_1300.s1254_number_of_closed_islands;
// #Medium #Array #Depth_First_Search #Breadth_First_Search #Matrix #Union_Find
// #Graph_Theory_I_Day_2_Matrix_Related_Problems
// #2022_03_12_Time_3_ms_(55.59%)_Space_46.4_MB_(60.84%)
public class Solution {
private int rows;
private int cols;
private boolean isLand;
public int closedIsland(int[][] grid) {
rows = grid.length;
cols = grid[0].length;
int result = 0;
for (int r = 0; r < rows; r++) {
for (int c = 0; c < cols; c++) {
if (grid[r][c] == 0) {
isLand = true;
dfs(grid, r, c);
if (isLand) {
result++;
}
}
}
}
return result;
}
private void dfs(int[][] grid, int r, int c) {
if (r == 0 || c == 0 || r == rows - 1 || c == cols - 1) {
isLand = false;
}
grid[r][c] = 'k';
if (r > 0 && grid[r - 1][c] == 0) {
dfs(grid, r - 1, c);
}
if (c > 0 && grid[r][c - 1] == 0) {
dfs(grid, r, c - 1);
}
if (r < rows - 1 && grid[r + 1][c] == 0) {
dfs(grid, r + 1, c);
}
if (c < cols - 1 && grid[r][c + 1] == 0) {
dfs(grid, r, c + 1);
}
}
}