Merge pull request #47 from AlgoLeadMe/13-kokeunho

13-kokeunho

kokeunho/README.md

@@ -14,4 +14,5 @@
 | 10차시 | 2024.11.30 | 자료구조 | [가운데를 말해요](https://www.acmicpc.net/problem/1655) | [#36](https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/36) |
 | 11차시 | 2024.12.21 | 그리디 알고리즘 | [회의실 배정](https://www.acmicpc.net/problem/1931) | [#43](https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/43) |
 | 12차시 | 2024.12.25 | 그리디 알고리즘 | [크게 만들기](https://www.acmicpc.net/problem/2812) | [#45](https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/45) |
+| 13차시 | 2024.12.30 | 그래프 탐색 | [숨바꼭질](https://www.acmicpc.net/problem/1697) | [#47](https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/47) |
 ---

kokeunho/그래프 탐색/13-kokeunho.java

@@ -0,0 +1,35 @@
+package org.example;
+
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+
+        int n = sc.nextInt();
+        int k = sc.nextInt();
+        int[] visited = new int[100001];
+        Arrays.fill(visited, -1);
+
+        Queue<Integer> queue = new LinkedList<>();
+        queue.add(n);
+        visited[n] = 0;
+
+        while(!queue.isEmpty()) {
+            int current = queue.poll();
+
+            if(current == k) {
+                System.out.println(visited[current]);
+                break;
+            }
+
+            for(int next : new int[]{current - 1, current + 1, current * 2}) {
+                if(next >= 0 && next <= 100000 && visited[next] == -1) {
+                    visited[next] = visited[current] + 1;
+                    queue.add(next);
+                }
+            }
+
+        }
+    }
+}