-
Notifications
You must be signed in to change notification settings - Fork 0
/
1245.js
58 lines (43 loc) · 1.47 KB
/
1245.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
/*
bfs -> 구현귀찮음
dfs
지점 하나 찍고 bfs, 본인과 같은 높이를 지니는 격자 전부 찾아서 방문
이 과정에서 주변에 나보다 높은게 있으면 봉우리 아님, 아니면 봉우리
*/
const INPUT_FILE = process.platform === 'linux' ? '/dev/stdin' : './input';
const [[row, col], ...farm] = require('fs').readFileSync(INPUT_FILE).toString().trim()
.split('\n')
.map((line) => line.split(' ').map(Number));
const visited = Array.from(new Array(row), () => new Array(col).fill(false));
const DIRECTIONS = [[0, 1], [0, -1], [1, 0], [-1, 0], [1, 1], [1, -1], [-1, 1], [-1, -1]];
const isMountainPeak = (startR, startC) => {
let isPeak = true;
const stack = [[startR, startC]];
const curHeight = farm[startR][startC];
while (stack.length) {
const [r, c] = stack.pop();
if (!visited[r][c]) {
visited[r][c] = true;
const lookAround = DIRECTIONS.reduce(
(isPeak, [dr, dc]) => {
const r2 = r + dr;
const c2 = c + dc;
if (r2 < 0 || r2 >= row || c2 < 0 || c2 >= col) return isPeak;
if (farm[r2][c2] > curHeight) return false;
if (farm[r2][c2] === curHeight) stack.push([r2, c2]);
return isPeak;
},
true,
);
isPeak &&= lookAround;
}
}
return isPeak;
};
let count = 0;
for (let r = 0; r < row; r += 1) {
for (let c = 0; c < col; c += 1) {
if (!visited[r][c] && isMountainPeak(r, c)) count += 1;
}
}
console.log(count);