-
Notifications
You must be signed in to change notification settings - Fork 0
/
8-island-bfs.js
53 lines (46 loc) · 1.19 KB
/
8-island-bfs.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
function solution(matrix) {
const n = matrix.length;
const dx = [-1, -1, 0, 1, 1, 1, 0, -1]; // 좌-좌상-상-우상-우-우하-하-좌하
const dy = [0, -1, -1, -1, 0, 1, 1, 1];
let result = 0;
const queue = [];
for (let i = 0; i < n; i++){ // matrix 탐색
for (let j = 0; j < n; j++){
if (matrix[i][j] === 1) {
matrix[i][j] = 0;
queue.push([i, j]);
result++;
while (queue.length) {
let v = queue.shift();
for(let i = 0; i < dx.length; i++){ // 모든 방향 탐색
const nx = v[0] + dx[i];
const ny = v[1] + dy[i];
if(
nx >= 0 && nx < n
&& ny >= 0 && ny < n
&& matrix[nx][ny] === 1
){
matrix[nx][ny] = 0;
queue.push([nx, ny]);
}
}
}
}
}
}
console.log(result);
return result;
}
// Execute Test
const exampleList = [
[
[1, 1, 0, 0, 0, 1, 0],
[0, 1, 1, 0, 1, 1, 0],
[0, 1, 0, 0, 0, 0, 0],
[0, 0, 0, 1, 0, 1, 1],
[1, 1, 0, 1, 1, 0, 0],
[1, 0, 0, 0, 1, 0, 0],
[1, 0, 1, 0, 1, 0, 0],
]
];
exampleList.forEach(example => solution(example));