蓝桥杯彻底解决迷宫问题

在蓝桥杯里，迷宫问题不是很难，大都是深搜或者广搜就写暴力写出来

最短情况：BFS
找到：DFS

一般迷宫的题，数据量都比较大，一般都是计算文本文件里面的

1. 获取数据
   python读取文本文件会将最后一个换行符也读到，所以要单独处理

   hang=4#获取行数，从文本文件中看一下
   ma=[]
   with open("E:\蓝桥杯\Python\真题\\2019\\t.txt") as f:
       for i in range(hang-1):#转化为二维列表
           ma.append(list(f.readline()[:-1]))
       ma.append(list(f.readline()))
       print(ma)
   

2. 套模板–》小蓝下面是参考小蓝的模板

BFS

求路径

借用一个queue队列，将入口放入
while queue：
queue.pop(0)
循环看四个方向哪个满足，加入队列

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
10000001100111010111010001000110111010101101111000

hang=30#获取行数
lie=50#获得列数
grid=[]
with open("E:\蓝桥杯\Python\真题\\2019\\t.txt") as f:
    for i in range(hang):#转化为二维列表
        grid.append(list(f.readline()[:lie]))
    print(grid)
    
queue=[]
m=[["" for i in range(lie)] for i in range(hang)]#记录访问过的字符串
queue.append((0,0))#入口放进去
while queue:
    x,y=queue.pop(0)#出队
    if x==hang-1 and y==lie-1:
        print(m[-1][-1])
        break
    #开始遍历
    for new_x,new_y,string in [(x+1,y,"D"),(x-1,y,"U"),(x,y-1,"L"),(x,y+1,"R")]:
        if (0<=new_x<hang) and (0<=new_y<lie) and (grid[new_x][new_y]=="0"):
            grid[new_x][new_y]="1"#记录是否访问过
            queue.append((new_x,new_y))
            m[new_x][new_y]=m[x][y]+string
            
#DDDDRRURRRRRRDRRRRDDDLDDRDDDDDDDDDDDDRDDRRRUUURRRRDDDDRDRRRRRURRRDRRDDDRRRRUURUUUUUUUULLLUUUURRRRUULLLUUUULLUUULUURRURRURURRRDDRRRRRDDRRDDLLLDDRRDDRDDLDDDLLDDLLLDLDDDLDDRRRRRRRRRDDDDDDRR

求次数

队列太慢，collections导入deque运行速度较快，程序不会超时，可以得满分。
不需要记录走过的路径

from collections import deque
hang,lie=map(int,input().split())
m=[list(map(int,input().split())) for i in range(hang)]#数据获取
x,y,ox,oy=map(int,input().split())#数据获取


queue=deque([(x-1,y-1,0)])#放入入口，三元组，用来记录路径长度
while queue:
    x,y,z=queue.popleft()
    if x==ox-1 and y==oy-1:#判断条件
        print(z)
        break
    for a,b in [(x+1,y),(x,y+1),(x-1,y),(x,y-1)]:
        if 0<=a<hang and 0<=b<lie and m[a][b]==1:
            m[a][b]=0
            queue.append((a,b,z+1))
if (x,y)!=(ox-1,oy-1):#不存在一条合法路径
    print(-1)