PROGRAMMERS 1844: 게임 맵 최단거리

Link : programmers.co.kr/learn/courses/30/lessons/1844

---

Python

from queue import Queue
 
# R D L U
direction = [(1, 0), (0, 1), (-1, 0), (0, -1)]
 
 
def ableMove(maps, x, y):
    if x < 0 or y < 0 or x >= len(maps[0]) or y >= len(maps):
        return False
    if maps[y][x] == 0:
        return False
    return True
 
 
def solution(maps):
    que = Queue()
    que.put((0, 0, 0))
    while que.qsize():
        x, y, d = que.get()
        if maps[y][x] != 0:
            maps[y][x] = 0
            if x == len(maps[0]) - 1 and y == len(maps) - 1:
                return d + 1
            for i in direction:
                if ableMove(maps, x + i[0], y + i[1]):
                    que.put((x + i[0], y + i[1], d + 1))
    return -1

FeedBack

1.  

---

 

 

 

cjw.git@gmail.com