[프로그래머스] 게임 맵 최단거리
기본 아이디어bfsfrom collections import dequedef solution(maps): n = len(maps) m = len(maps[0]) ax = [-1, 0, 1, 0] ay = [0, 1, 0, -1] queue = deque([(0, 0, 1)]) visited = set() visited.add((0, 0)) while queue: x, y, cnt = queue.popleft() if x == n - 1 and y == m - 1: return cnt for dx, dy in zip(ax, ay): nx, ny = x + dx, y + dy ..
2025. 4. 7.