[백준][Python] 1697번 숨바꼭질

1697번: 숨바꼭질

 

 

코드

from collections import deque
def dfs():
	queue = deque()
	queue.append(n)
	while queue:
		nx = queue.popleft()
		if nx == k:
			return visit[nx]
		for i in (nx-1,nx+1,nx*2):
			if 0 <= i <= 100000 and visit[i] == 0:
				visit[i] = visit[nx] + 1
				queue.append(i) 
n, k  = map(int,input().split())
visit = [0] * (100001)
print(dfs())