-
Notifications
You must be signed in to change notification settings - Fork 41
/
solution.js
47 lines (45 loc) · 1.24 KB
/
solution.js
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
/**
* @param {number[][]} grid1
* @param {number[][]} grid2
* @return {number}
*/
var countSubIslands = function (grid1, grid2) {
const M = grid1.length;
const N = grid1[0].length;
const visited = new Array(M);
for (let i = 0; i < M; i++) {
visited[i] = new Array(N).fill(false);
}
let result = 0;
const match = (x, y) => {
if (x === -1 || y === -1 || x === M || y === N || visited[x][y] || grid2[x][y] === 0) {
return true;
}
visited[x][y] = true;
if (grid1[x][y] === 0) {
return false;
}
return match(x, y - 1) && match(x, y + 1) && match(x + 1, y) && match(x - 1, y);
};
const floodFill = (x, y) => {
if (x === -1 || y === -1 || x === M || y === N || grid2[x][y] === 0) {
return;
}
grid2[x][y] = 0;
floodFill(x - 1, y);
floodFill(x + 1, y);
floodFill(x, y - 1);
floodFill(x, y + 1);
};
for (let i = 0; i < M; i++) {
for (let j = 0; j < N; j++) {
if (grid1[i][j] && grid2[i][j]) {
if (match(i, j)) {
result++;
}
floodFill(i, j);
}
}
}
return result;
};