-
Notifications
You must be signed in to change notification settings - Fork 0
/
DFS1(recursive)(2).js
61 lines (52 loc) · 1.08 KB
/
DFS1(recursive)(2).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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
const { count } = require('console')
const { off, mainModule } = require('process')
const readline = require('readline')
const rl = readline.createInterface({
input: process.stdin,
output: process.stdout,
})
const data = []
rl.on('line', (input) => {
data.push(input)
}).on('close', () => {
let [N, M] = data.shift().split(' ').map(Number)
let board = data.map((i) => i.split('').map(Number))
let cord = [
[-1, 0],
[1, 0],
[0, -1],
[0, 1],
]
const dfs = (i, j) => {
board[i][j] = 1
for (let k = 0; k < cord.length; k++) {
if (
i + cord[k][0] <= -1 ||
i + cord[k][0] >= N ||
j + cord[k][1] <= -1 ||
j + cord[k][1] >= M
) {
continue
}
if (board[i + cord[k][0]][j + cord[k][1]] === 0) {
dfs(i + cord[k][0], j + cord[k][1])
}
}
}
let result = 0
for (let i = 0; i < N; i++) {
for (let j = 0; j < M; j++) {
if (board[i][j] === 0) {
dfs(i, j)
result++
}
}
}
console.log(result)
process.exit()
})
// 4 5
// 00110
// 00011
// 11111
// 00000