昨天做了下美团的KPI笔试,问:思路:DFS 需要一个visited数组存放遍历每条路径已经访问过的节点代码: n, m = map(int, input().split()) a = [] for _ in range(n): a.append(list(input())) s = ['A', 'B', 'C', 'D', 'E'] visited = [] def dfs(i, j, res=0): if a[i][j] == s[(res) % 5] and (i, j) not in visited: print(i, j, s[res % 5]) ...