maze.txt文件内容如下：
01010101001011001001010110010110100100001000101010 00001000100000101010010000100000001001100110100101 01111011010010001000001101001011100011000000010000 01000000001010100011010000101000001010101011001011 00011111000000101000010010100010100000101100000000 11001000110101000010101100011010011010101011110111 00011011010101001001001010000001000101001110000000 10100000101000100110101010111110011000010000111010 00111000001010100001100010000001000101001100001001 11000110100001110010001001010101010101010001101000 00010000100100000101001010101110100010101010000101 11100100101001001000010000010101010100100100010100 00000010000000101011001111010001100000101010100011 10101010011100001000011000010110011110110100001000 10101010100001101010100101000010100000111011101001 10000000101100010000101100101101001011100000000100 10101001000000010100100001000100000100011110101001 00101001010101101001010100011010101101110000110101 11001010000100001100000010100101000001000111000010 00001000110000110101101000000100101001001000011101 10100101000101000000001110110010110101101010100001 00101000010000110101010000100010001001000100010101 10100001000110010001000010101001010101011111010010 00000100101000000110010100101001000001000000000010 11010000001001110111001001000011101001011011101000 00000110100010001000100000001000011101000000110011 10101000101000100010001111100010101001010000001000 10000010100101001010110000000100101010001011101000 00111100001000010000000110111000000001000000001011 10000001100111010111010001000110111010101101111000Ideas
迷宫问题想搜索，最优问题想广搜。
广搜需要使用队列，队列元素存储(x, y, path)，分别表示当前到达的位置坐标和路径。
然后遍历(x, y)位置的上、下、左、右四个方向，分别判断有没有障碍，选择没有障碍的方向继续前进，一直走到出口为止。
Code Pythonfrom collections import deque if __name__ == '__main__': maze = [] with open("./maze.txt") as fp: for line in fp.readlines(): maze.append(list(line.strip())) rows, cols = len(maze), len(maze[0]) visit = [[False] * cols for _ in range(rows)] queue = deque() queue.append((0, 0, "")) while queue: x, y, path = queue.popleft() if x == rows - 1 and y == cols - 1: print(path) break direct = ['R', 'D', 'L', 'U'] for i, (dx, dy) in enumerate([(0, 1), (1, 0), (0, -1), (-1, 0)]): nx, ny = x + dx, y + dy if -1 < nx < rows and -1 < ny < cols and maze[nx][ny] == '0' and not visit[nx][ny]: queue.append((nx, ny, path + direct[i])) visit[nx][ny] = True
