Skip to content

Commit 3de6884

Browse files
committed
[level 2] Title: 미로 탈출, Time: 18.13 ms, Memory: 50.9 MB -BaekjoonHub
1 parent 6446f7e commit 3de6884

2 files changed

Lines changed: 37 additions & 34 deletions

File tree

‎프로그래머스/2/159993. 미로 탈출/README.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44

55
### 성능 요약
66

7-
메모리: 36.5 MB, 시간: 25.26 ms
7+
메모리: 50.9 MB, 시간: 18.13 ms
88

99
### 구분
1010

@@ -16,7 +16,7 @@
1616

1717
### 제출 일자
1818

19-
2026년 05월 06일 19:00:31
19+
2026년 10월 25일 12:35:19
2020

2121
### 문제 설명
2222

Lines changed: 35 additions & 32 deletions
Original file line numberDiff line numberDiff line change
@@ -1,61 +1,64 @@
1+
/**
2+
* 출발 지점 -> 레버 칸 -> 출구 문
3+
* ==>> 출발지점 ~ 레버칸 bfs 1차 + 레버칸 ~ 출구 bfs 2차
4+
*
5+
* 한 칸 이동하는데에 1초 -> 최단시간(=1초 걸리므로 최단거리)
6+
**/
7+
8+
//상하좌우
19
const dr = [-1, 1, 0, 0];
210
const dc = [0, 0, -1, 1];
311

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+
}
1015

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;
1219

20+
const queue = [ts];
1321
let head = 0;
14-
while (head < queue.length) {
15-
const [r, c, dist] = queue[head++];
1622

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];
1826

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];
2230

2331
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
2935
) {
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]);
3438
}
3539
}
3640
}
3741
return -1;
3842
}
3943

4044
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;
4447
let start, lever, exit;
4548

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++) {
4851
if (maps[i][j] === "S") start = [i, j];
4952
else if (maps[i][j] === "L") lever = [i, j];
5053
else if (maps[i][j] === "E") exit = [i, j];
5154
}
5255
}
5356

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;
5659

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;
5962

60-
return step1 + step2;
63+
return toLever + toExit;
6164
}

0 commit comments

Comments
 (0)