31-alstjr7437 (#218)

* 31차시 solved

* swift 코드 추가

alstjr7437/BFS/게임-맵-최단거리.py

@@ -0,0 +1,51 @@
+import Foundation
+
+func solution(_ maps: [[Int]]) -> Int {
+    var maps = maps
+    let dx = [-1, 1, 0, 0]
+    let dy = [0, 0, -1, 1]
+    let rowCount = maps.count
+    let colCount = maps[0].count
+
+    func bfs(_ x: Int, _ y: Int) -> Int {
+        var queue = [(x, y)]
+        var index = 0
+
+        while index < queue.count {
+            let (x, y) = queue[index]
+            index += 1
+
+            for i in 0..<4 {
+                let nx = x + dx[i]
+                let ny = y + dy[i]
+
+                if nx < 0 || nx >= rowCount || ny < 0 || ny >= colCount {
+                    continue
+                }
+
+                if maps[nx][ny] == 0 {
+                    continue
+                }
+
+                if maps[nx][ny] == 1 {
+                    maps[nx][ny] = maps[x][y] + 1
+                    queue.append((nx, ny))
+                }
+            }
+        }
+
+        return maps[rowCount - 1][colCount - 1]
+    }
+
+    let answer = bfs(0, 0)
+    return answer == 1 ? -1 : answer
+}
+
+// 예시 호출
+let maps = [
+    [1, 0, 1, 1, 1],
+    [1, 0, 1, 0, 1],
+    [1, 1, 1, 0, 1],
+    [0, 0, 0, 0, 1]
+]
+print(solution(maps)) // 출력: 11

alstjr7437/BFS/게임-맵-최단거리.swift

@@ -0,0 +1,47 @@
+import Foundation
+
+func solution(_ maps: inout [[Int]]) -> Int {
+    let dx = [-1, 1, 0, 0]
+    let dy = [0, 0, -1, 1]
+    let rowCount = maps.count
+    let colCount = maps[0].count
+
+    func bfs(_ x: Int, _ y: Int) -> Int {
+        var queue = [(x, y)]
+        var index = 0
+
+        while index < queue.count {
+            let (x, y) = queue[index]
+            index += 1
+
+            for i in 0..<4 {
+                let nx = x + dx[i]
+                let ny = y + dy[i]
+
+                if nx < 0 || nx >= rowCount || ny < 0 || ny >= colCount { continue }
+
+                if maps[nx][ny] == 0 { continue }
+
+                if maps[nx][ny] == 1 {
+                    maps[nx][ny] = maps[x][y] + 1
+                    queue.append((nx, ny))
+                }
+            }
+        }
+
+        return maps[rowCount - 1][colCount - 1]
+    }
+
+    let answer = bfs(0, 0)
+    return answer == 1 ? -1 : answer
+}
+
+// 예시 호출
+var maps = [
+    [1, 0, 1, 1, 1],
+    [1, 0, 1, 0, 1],
+    [1, 0, 1, 1, 1],
+    [1, 1, 1, 0, 1],
+    [0, 0, 0, 0, 1] 
+]
+print(solution(&maps)) // 출력: 11

alstjr7437/README.md

@@ -31,4 +31,5 @@
 | 27차시 | 2024.05.26 |  우선순위 큐  | <a href="https://www.acmicpc.net/problem/7662">이중 우선순위 큐</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/198 |
 | 28차시 | 2024.05.30 |  브루트 포스  | <a href="https://www.acmicpc.net/problem/6064">카잉 달력</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/203 |
 | 29차시 | 2024.06.11 |  이분 탐색  | <a href="https://www.acmicpc.net/problem/2805">나무 자르기</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/210 |
-| 30차시 | 2024.06.19 |  방 번호  | <a href="https://www.acmicpc.net/problem/1475">구현</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/211 |
+| 30차시 | 2024.06.19 |  방 번호  | <a href="https://www.acmicpc.net/problem/1475">구현</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/211 |
+| 31차시 | 2024.06.19 |  게임 맵 최단거리  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/1844">BFS</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/218 |