We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 989e8fb commit 1fbe63dCopy full SHA for 1fbe63d
kojungbeom/Programmers/Level2/숫자 변환하기.py
@@ -0,0 +1,22 @@
1
+from collections import deque
2
+
3
+def solution(x, y, n):
4
+ visited = set()
5
+ queue = deque([(x, 0)]) # (현재 수, 연산 횟수)
6
7
+ while queue:
8
+ current, count = queue.popleft()
9
10
+ if current == y:
11
+ return count
12
13
+ if current > y:
14
+ continue
15
16
+ if current not in visited:
17
+ visited.add(current)
18
+ queue.append((current + n, count + 1))
19
+ queue.append((current * 2, count + 1))
20
+ queue.append((current * 3, count + 1))
21
22
+ return -1
0 commit comments