【leetcode】-773. Sliding Puzzle 滑动迷道

题目

On a 2x3 board, there are 5 tiles represented by the integers 1 through 5, and an empty square represented by 0.

A move consists of choosing 0 and a 4-directionally adjacent number and swapping it.

The state of the board is solved if and only if the board is [[1,2,3],[4,5,0]].

Given a puzzle board, return the least number of moves required so that the state of the board is solved. If it is impossible for the state of the board to be solved, return -1.

Examples:

Input: board = [[1,2,3],[4,0,5]]
Output: 1
Explanation: Swap the 0 and the 5 in one move.

Input: board = [[1,2,3],[5,4,0]]
Output: -1
Explanation: No number of moves will make the board solved.

Input: board = [[4,1,2],[5,0,3]]
Output: 5
Explanation: 5 is the smallest number of moves that solves the board.
An example path:
After move 0: [[4,1,2],[5,0,3]]
After move 1: [[4,1,2],[0,5,3]]
After move 2: [[0,1,2],[4,5,3]]
After move 3: [[1,0,2],[4,5,3]]
After move 4: [[1,2,0],[4,5,3]]
After move 5: [[1,2,3],[4,5,0]]
Input: board = [[3,2,4],[1,5,0]]
Output: 14
Note:

board will be a 2 x 3 array as described above.
board[i][j] will be a permutation of [0, 1, 2, 3, 4, 5].

bfs

对问题进行穷举后进行优化，可用bfs思想。

首先将二维数组变为一维字符串，变成字符串是方便后面进行索引处理。然后看初始的一维字符串最终能否变成“123450”，如果能，用bfs思想得到最小移动次数，bfs就是看0位置的上下左右方向的相邻元素，然后交换位置进行穷举，看交换位置后能否更接近最终目标；否则，返回-1.

python代码

class Solution(object):
    def slidingPuzzle(self, board):
        """
        :type board: List[List[int]]
        :rtype: int
        """
        m,n = 2,3
        start = ""
        for i in range(m):
            for j in range(n):
                start += str(board[i][j])
        target = "123450"
        dirs = [(0,1),(1,0),(0,-1),(-1,0)]
        
        queue = []
        visited = set()
        queue.append((start,0))
        visited.add(start)
    
        while queue:
            cur,step = queue.pop(0)
            if cur == target:
                return step
            idx = cur.index('0')
            x,y = idx//3,idx%3
            cur = list(cur)
            for dir in dirs:
                tx, ty = x + dir[0], y + dir[1]
                if tx < 0 or tx >= 2 or ty < 0 or ty >= 3:
                    continue
                cur[tx * 3 + ty],cur[x * 3 + y] =cur[x * 3 + y],cur[tx * 3 + ty]
                curStr = "".join(cur)
                if curStr not in visited:
                    queue.append((curStr,step+1))
                    visited.add(curStr)
                cur[tx * 3 + ty],cur[x * 3 + y] =cur[x * 3 + y],cur[tx * 3 + ty]

        return -1