[파이썬🐍] 프로그래머스 : 게임 맵 최단거리
from collections import deque def solution(maps): n,m=len(maps),len(maps[0]) dx,dy=[1,0,-1,0],[0,1,0,-1] visited=[[0 for _ in range(m)] for _ in range(n)] visited[0][0]=1 queue=deque([(0,0)]) while queue: x,y=queue.popleft() if x==n-1 and y==m-1: return visited[x][y] for i in range(4): nx,ny=x+dx[i], y+dy[i] if 0
2021. 5. 13.