[BFS] 게임 맵 최단거리

코딩테스트 연습 - 게임 맵 최단거리

from collections import deque
def solution(maps):
    answer = 0
    dx = [-1, 1, 0, 0]
    dy = [0, 0, -1, 1]
    n = len(maps)
    m = len(maps[0])
    visited = [[False] * m for _ in range(n)]
    #
    # for i in visited:
    #     print(i)
 
    q = deque([(0, 0)])
    visited[0][0] = True
    while q:
        x, y = q.popleft()
        for i in range(4):
            nx = x + dx[i]
            ny = y + dy[i]
 
            if 0 <= nx < n and 0 <= ny < m:
                if not visited[nx][ny] and maps[nx][ny] == 1:
                    visited[nx][ny] = True
                    maps[nx][ny] = maps[x][y] + 1
                    q.append((nx, ny))
 
    if maps[n-1][m-1] != 1:
        return maps[n-1][m-1]
    else:
        return -1