773.滑动谜题

最新推荐文章于 2022-08-03 11:15:06 发布

江小北

最新推荐文章于 2022-08-03 11:15:06 发布

阅读量107

点赞数 1

分类专栏：算法刷题笔记

本文链接：https://blog.csdn.net/FeNGQiHuALOVE/article/details/116136730

版权

算法刷题笔记专栏收录该内容

157 篇文章 0 订阅

订阅专栏

在这里插入图片描述

class Solution:
    def slidingPuzzle(self, board):
        res = []
        board_res = [[1, 2, 3], [4, 5, 0]]
        ans = 0
        if board == board_res:
            return ans
        q = [board]
        new = [[-1, 0], [0, 1], [1, 0], [0, -1]]
        while q:
            size = len(q)
            ans = ans + 1
            while size:
                # 查找0的坐标
                for i in range(2):
                    for j in range(3):
                        if q[0][i][j] == 0:
                            zero_i = i
                            zero_j = j
                            break
                for new_x, new_y in new:
                    tmp = copy.deepcopy((q[0]))
                    if 0 <= zero_i + new_x <= 1 and 0 <= zero_j + new_y <= 2:
                        # 交换位置
                        tmp[zero_i][zero_j], tmp[zero_i + new_x][zero_j + new_y] = tmp[zero_i + new_x][zero_j + new_y], \
                                                                                tmp[zero_i][zero_j]
                        if tmp not in res:
                            res.append(tmp)
                            if tmp == board_res:
                                return ans
                            q.append(tmp)
                size = size - 1
                q.pop(0)
        return -1