Feat: 6월 2주차 과제 문제 정답 풀이 업로드

Author: Mingguriguri

_WeeklyChallenges/W26-[Graph-BFS]/Assignment_BOJ_1697_숨바꼭질.py

@@ -4,4 +4,23 @@
 유형: Graph, BFS
 """
 
-# PR 올릴 때 정답도 함께 공개 예정
+import sys
+from collections import deque
+input = sys.stdin.readline
+
+MAX = 100000
+N, K = map(int, input().split())
+
+visited = [0] * (MAX+1)
+queue = deque([N])
+
+while queue:
+    current = queue.popleft()
+    if current == K:
+        break
+    for nx in (current + 1, current - 1, current * 2):
+        if 0 <= nx <= MAX and not visited[nx]:
+            visited[nx] = visited[current] + 1
+            queue.append(nx)
+
+print(visited[K])