python迷宫问题dfs,bfs汇总

原题是蓝桥杯1216

import sys

sys.setcursionlimit(999999)  # 设置最大递归深度，dfs会用到


def dfs(startx, starty, step):
    global min_step, flag
    if startx == x2 and starty == y2:
        if step < min_step:
            min_step = step
            flag = False
        return
    for i in range(4):
        tx = startx + dirs[i][0]
        ty = starty + dirs[i][1]
        if 0 <= tx < n and 0 <= ty < m:
            if road[tx][ty] == 1 and vis[tx][ty] == 0:
                vis[tx][ty] = 1
                dfs(tx, ty, step + 1)
                vis[tx][ty] = 0


def bfs(startx, starty, step):
    global queue, flag, min_step
    while queue:
        startx, starty, step = queue[0]
        if startx == x2 and starty == y2:
            min_step = step
            break
        for i in range(4):
            tx = startx + dirs[i][0]
            ty = starty + dirs[i][1]
            if 0 <= tx < n and 0 <= ty < m:
                # if road[tx][ty] == 1:
                #     road[tx][ty] = 0
                if road[tx][ty] == 1 and vis[tx][ty] == 0:
                    vis[tx][ty] = 1
                    queue.append([tx, ty, step + 1])
        queue.pop(0)
    else:  # break没有正常执行，也就是while正常退出没有遇到break强行退出
        flag = False


n, m = map(int, input().split())
# road = [input().split() for i in range(n)]  # 错误写法,二位列表中的一维列表每一项是字符串而不是数字
road = [list(map(int, input().split())) for _ in range(n)]  # 1路0障碍
x1, y1, x2, y2 = [int(i)-1 for i in input().split()]
vis = [[0 for i in range(m)] for j in range(n)]  # 1标记0未标记
dirs = [[-1, 0], [1, 0], [0, -1], [0, 1]]
min_step = float('inf')  # 无限大,float('-inf')无穷小
flag = True  # 能否到达终点

# dfs(x1, y1, 0)
# if not flag:
#     min_step = -1
# print(min_step)

queue = [[x1, y1, 0]]
bfs(x1, y1, 0)
if not flag:
    min_step = -1
print(min_step)

这道题用bfs即可AC，dfs会超时