这是代码,在走回(2,0)走向(2,1)时列表a中记录路径的值会变(2,0)会变成(2,1)from copy import deepcopyx,y = map(int,input().split())end = [x-1,y-1]mx = []start = [0,0]for i in range(x): mx.append(list(map(int,input().split())))a = [[0,0]]def bfs(e,m,a): if e == end: return a if 0<=e[0]+1< x and m[e[0]+1][e[1...