프로그래머스 - 숫자 변환하기 (L2)

 1from collections import deque
 2
 3def solution(x, y, n):
 4    q = deque()
 5    visited = [False] * 1000001
 6    q.append((x, 0))
 7    
 8    while q:
 9        cx, cnt = q.popleft()
10        if cx == y:
11            return cnt
12        
13        if cx + n <= y and not visited[cx+n]:
14            q.append((cx+n, cnt+1))
15            visited[cx+n] = True
16        if cx * 2 <= y and not visited[cx*2]:
17            q.append((cx*2, cnt+1))
18            visited[cx*2] = True
19        if cx * 3 <= y and not visited[cx*3]:
20            q.append((cx*3, cnt+1))
21            visited[cx*3] = True
22    return -1