Leetcode 1926. Nearest Exit from Entrance in Maze [Python]

最新推荐文章于 2025-02-17 20:24:10 发布

Case_CaiNiao

最新推荐文章于 2025-02-17 20:24:10 发布

阅读量552

点赞数 1

分类专栏： Leetcode学习记录文章标签： leetcode python 图论

本文链接：https://blog.csdn.net/sinat_30403031/article/details/121858163

版权

Leetcode学习记录专栏收录该内容

268 篇文章

订阅专栏

没啥好说的， BFS。代码里，遍历过的空位置其实可以不改，但是要过全部的TC的话，需要把遍历过的空位置改为墙。

class Solution:
    def nearestExit(self, maze: List[List[str]], entrance: List[int]) -> int:
        Row = len(maze)
        Col = len(maze[0])
        x = entrance[0]
        y = entrance[1]
        dirt = [(1,0),(0,1),(-1,0),(0,-1)]
        que = collections.deque()
        que.append((x,y))
        meet = set()
        res = 0
        while que:
            size = len(que)
            for _ in range(size):
                i,j = que.popleft()
                meet.add((i,j))
                for di, dj in dirt:
                    newi = i + di
                    newj = j + dj
                    if 0 <= newi < Row and 0 <= newj < Col and maze[newi][newj] == '.' and (newi,newj) not in meet:
                        if newi == 0 or newi == Row - 1 or newj == 0 or newj == Col - 1:
                            return res + 1
                        else:
                            maze[newi][newj] = '+' #不加这行就会TLE
                            que.append((newi, newj))
            res += 1
        return -1