本文共 1150 字，大约阅读时间需要 3 分钟。

题目：（中等）

标签：广度优先搜索

解法一：

class Solution:    def snakesAndLadders(self, board: List[List[int]]) -> int:        m, n = len(board), len(board[0])        # 将蛇形棋转换为列表        lst = [0]        reverse = False        for i in range(m - 1, -1, -1):            if not reverse:                lst.extend(board[i])            else:                lst.extend(reversed(board[i]))            reverse = not reverse        # 广度优先搜索        step = 0        visited = {
   1: 0}        queue = collections.deque([1])        while queue:            step += 1            for _ in range(len(queue)):                n1 = queue.popleft()                for n2 in range(n1 + 1, n1 + 7):                    if n2 == m * n:                        return step                    if lst[n2] != -1:                        n2 = lst[n2]                    if n2 == m * n:                        return step                    if n2 not in visited or visited[n2] > step:                        visited[n2] = step                        queue.append(n2)        return -1

转载地址：https://dataartist.blog.csdn.net/article/details/112788959 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！