-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path00200-number_of_islands.java
57 lines (46 loc) · 1.21 KB
/
00200-number_of_islands.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
50
51
52
53
54
55
56
57
// 200: Number Of Islands
// https://leetcode.com/problems/number-of-islands/
class Solution {
private void dfs(char[][] grid, int i, int j) {
if (
i < 0 ||
j < 0 ||
i >= grid.length ||
j >= grid[0].length ||
grid[i][j] == '0'
) {
return;
}
grid[i][j] = '0';
dfs(grid, i + 1, j);
dfs(grid, i, j + 1);
dfs(grid, i - 1, j);
dfs(grid, i, j - 1);
}
// SOLUTION
public int numIslands(char[][] grid) {
int result = 0;
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length; j++) {
if (grid[i][j] == '1') {
dfs(grid, i, j);
result++;
}
}
}
return result;
}
public static void main(String[] args) {
Solution o = new Solution();
// INPUT
char[][] grid = {
{'1','1','1','1','0'},
{'1','1','0','1','0'},
{'1','1','0','0','0'},
{'0','0','0','0','0'}
};
// OUTPUT
var result = o.numIslands(grid);
System.out.println(result);
}
}