[백준] 1697번_숨바꼭질

문제 링크 : https://www.acmicpc.net/problem/1697

1697번: 숨바꼭질

from collections import deque
s, sis = map(int,input().split())

def bfs(x):
    q = deque()
    check = [0]*200001
    q.append(x)
    while q:
        x = q.popleft()
        if x == sis:
            return check[x]
        for nx in (x+1,x-1,x*2):
            if 0<=nx<200001 and check[nx]==0:
                check[nx] = check[x]+1
                q.append(nx)
        

print(bfs(s))