|
| 1 | +/** |
| 2 | + * 출발 지점 -> 레버 칸 -> 출구 문 |
| 3 | + * ==>> 출발지점 ~ 레버칸 bfs 1차 + 레버칸 ~ 출구 bfs 2차 |
| 4 | + * |
| 5 | + * 한 칸 이동하는데에 1초 -> 최단시간(=1초 걸리므로 최단거리) |
| 6 | + **/ |
| 7 | + |
| 8 | +//상하좌우 |
1 | 9 | const dr = [-1, 1, 0, 0]; |
2 | 10 | const dc = [0, 0, -1, 1]; |
3 | 11 |
|
4 | | -function bfs(startPos, targetPos, maps, R, C) { |
5 | | - const [sr, sc] = startPos; |
6 | | - const [tr, tc] = targetPos; |
7 | | - |
8 | | - const visited = Array.from({ length: R }, () => Array(C).fill(false)); |
9 | | - const queue = [[sr, sc, 0]]; |
| 12 | +function in_range(nr, nc, n, m) { |
| 13 | + return nr >= 0 && nr < n && nc >= 0 && nc < m; |
| 14 | +} |
10 | 15 |
|
11 | | - visited[sr][sc] = true; |
| 16 | +function bfs(ts, te, maps, n, m) { |
| 17 | + const dist = Array.from({ length: n }, () => new Array(m).fill(-1)); |
| 18 | + dist[ts[0]][ts[1]] = 0; |
12 | 19 |
|
| 20 | + const queue = [ts]; |
13 | 21 | let head = 0; |
14 | | - while (head < queue.length) { |
15 | | - const [r, c, dist] = queue[head++]; |
16 | 22 |
|
17 | | - if (r === tr && c === tc) return dist; |
| 23 | + while (head < queue.length) { |
| 24 | + const [r, c] = queue[head++]; |
| 25 | + if (r === te[0] && c === te[1]) return dist[r][c]; |
18 | 26 |
|
19 | | - for (let i = 0; i < 4; i++) { |
20 | | - const nr = r + dr[i]; |
21 | | - const nc = c + dc[i]; |
| 27 | + for (let d = 0; d < 4; d++) { |
| 28 | + const nr = r + dr[d]; |
| 29 | + const nc = c + dc[d]; |
22 | 30 |
|
23 | 31 | if ( |
24 | | - nr >= 0 && |
25 | | - nr < R && |
26 | | - nc >= 0 && |
27 | | - nc < C && |
28 | | - maps[nr][nc] !== "X" |
| 32 | + in_range(nr, nc, n, m) && |
| 33 | + maps[nr][nc] !== "X" && |
| 34 | + dist[nr][nc] === -1 |
29 | 35 | ) { |
30 | | - if (!visited[nr][nc]) { |
31 | | - visited[nr][nc] = true; |
32 | | - queue.push([nr, nc, dist + 1]); |
33 | | - } |
| 36 | + dist[nr][nc] = dist[r][c] + 1; |
| 37 | + queue.push([nr, nc]); |
34 | 38 | } |
35 | 39 | } |
36 | 40 | } |
37 | 41 | return -1; |
38 | 42 | } |
39 | 43 |
|
40 | 44 | function solution(maps) { |
41 | | - const R = maps.length; |
42 | | - const C = maps[0].length; |
43 | | - |
| 45 | + const n = maps.length; |
| 46 | + const m = maps[0].length; |
44 | 47 | let start, lever, exit; |
45 | 48 |
|
46 | | - for (let i = 0; i < R; i++) { |
47 | | - for (let j = 0; j < C; j++) { |
| 49 | + for (let i = 0; i < n; i++) { |
| 50 | + for (let j = 0; j < m; j++) { |
48 | 51 | if (maps[i][j] === "S") start = [i, j]; |
49 | 52 | else if (maps[i][j] === "L") lever = [i, j]; |
50 | 53 | else if (maps[i][j] === "E") exit = [i, j]; |
51 | 54 | } |
52 | 55 | } |
53 | 56 |
|
54 | | - const step1 = bfs(start, lever, maps, R, C); |
55 | | - if (step1 === -1) return -1; |
| 57 | + const toLever = bfs(start, lever, maps, n, m); |
| 58 | + if (toLever === -1) return -1; |
56 | 59 |
|
57 | | - const step2 = bfs(lever, exit, maps, R, C); |
58 | | - if (step2 === -1) return -1; |
| 60 | + const toExit = bfs(lever, exit, maps, n, m); |
| 61 | + if (toExit === -1) return -1; |
59 | 62 |
|
60 | | - return step1 + step2; |
| 63 | + return toLever + toExit; |
61 | 64 | } |
0 commit comments