[프로그래머스] Lv 2. 게임 맵 최단거리
def solution(maps): answer = 0 #상,하,좌,우 X = len(maps[0]) Y = len(maps) visited = [[False for _ in range(X)] for _ in range(Y)] dx = [0,0,-1,1] dy = [-1,1,0,0] queue = [] def bfs(x, y): visited[y][x] = True queue.append([y, x]) while queue: current = queue.pop(0) y, x = current[0], current[1] for i in..
2024. 7. 19.