每日一道Leetcode - 773. 滑动谜题【BFS】

最新推荐文章于 2024-09-27 17:31:02 发布

奋进的杰西

最新推荐文章于 2024-09-27 17:31:02 发布

阅读量68

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/weixin_41041275/article/details/115284642

版权

滑动拼图六角拼图算法广度优先搜索状态搜索

关键词由CSDN通过智能技术生成

Leetcode 专栏收录该内容

304 篇文章 1 订阅

订阅专栏

在这里插入图片描述

class Solution:
    def slidingPuzzle(self, board: List[List[int]]) -> int:
        # 记录每一个数字的相邻数字的索引
        neighbor = [
            [1,3],
            [0,4,2],
            [1,5],
            [0,4],
            [3,1,5],
            [4,2]
        ]
        # 压缩成一维字符串
        start = "".join([str(board[i][j]) for i in range(2) for j in range(3)])
        target = "123450"
        visited = set()
        step = 0
        queue = collections.deque()
        queue.append(start)
        visited.add(start)

        while queue:
            size = len(queue)
            for i in range(size):
                cur = queue.popleft()
                if cur == target:
                    return step
                id_zero = cur.index('0')
                for adj in neighbor[id_zero]:
                    cur_string = cur
                    temp = cur_string[adj]
                    cur_string = cur_string[:adj]+ '0' + cur_string[adj+1:]
                    cur_string = cur_string[:id_zero] + temp + cur_string[id_zero+1:]
                    if cur_string not in visited:
                        queue.append(cur_string)
                        visited.add(cur_string)
            step+=1
        return -1