[Python/프로그래머스]게임 맵 최단거리_(BFS)

 

 

https://school.programmers.co.kr/learn/courses/30/lessons/1844

프로그래머스

 

 

 

정말 쉽다.

그냥 BFS 

 

 

from collections import deque
dx = [0,1,0,-1]
dy = [1,0,-1,0]

def solution(maps):
    q = deque([[0,0]])
    n,m = len(maps), len(maps[0])
    
    while q :
        x,y = q.popleft()
        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] ==1 :
                maps[nx][ny] = maps[x][y] +1 
                q.append([nx,ny])  
                
    if maps[n-1][m-1] == 1 : return -1            
    else: return maps[n-1][m-1]

 

 

🐾 20220924