[프로그래머스/파이썬] 게임 맵 최단거리

 

 

나의 풀이

from collections import deque

def solution(maps):
    dx, dy = [1, 0, -1, 0], [0, 1, 0, -1]
    n, m = len(maps), len(maps[0])
    depth = [[0] * m for _ in range(n)]
    queue = deque([(0, 0)])
    answer = -1

    depth[0][0] = 1

    while queue:
        x, y = queue.popleft()

        if (x, y) == (n - 1, m - 1):
            answer = depth[x][y]
            break

        for i in range(4):
            nx, ny = x + dx[i], y + dy[i]
            if 0 <= nx < n and 0 <= ny < m and maps[nx][ny] and not depth[nx][ny]:
                queue.append((nx, ny))
                depth[nx][ny] = depth[x][y] + 1

    return answer