n,m = map(int,input().strip().split())#获取行和列 maze1 = [] for i in range(n): maze1.append(list(map(int,input().split())))#变成int将无引号 x, y = 0, 0 step=0 start=(0,0) end=(n-1,m-1) que=[] que.append(start) #print(maze1) #获取矩阵列表 while que: step += 1 for _ in range(len(que)): now=que.pop(0) r, c = now #解包 maze1[r][c]=3 if now == end: for t in que: print(t) for rk, ck in [(r-1,c), (r+1,c), (r, c-1), (r,c+1)]: if 0 <= rk < n and 0 <= ck < m and not maze1[rk][ck]: maze1[rk][ck]=3 que.append((rk,ck)) 大神帮忙看看我的bfs哪里有问题？