def findMazePath(maps): if not maps or not maps[0]: return 0 rows, cols = len(maps), len(maps[0]) directions = [(-1, 0), (0, -1), (1, 0), (0, 1)] # 记录已经访问过的单元格 visited = [[False for _ in range(cols)] for _ in range(rows)] path = [] def dfs(i, j): # 若为...