这是正确的答案：
def route_finder_helper(x, y, current_path, filler, list_of_lists): current_path[filler] = (x, y) if x == 0 and y == 0: return list_of_lists + [current_path[:]] if x == 0: return route_finder_helper(x, y - 1, current_path, filler - 1, list_of_lists) if y == 0: return route_finder_helper(x - 1, y, current_path, filler - 1, list_of_lists) return route_finder_helper(x-1, y, current_path, filler - 1, list_of_lists) + route_finder_helper(x, y-1, current_path, filler - 1, list_of_lists)x_coordinate = 2y_coordinate = 2path_length = (x_coordinate + 1) + (y_coordinate + 1) - 1start_filling = path_length - 1current_path = [0] * path_lengthpaths = route_finder_helper(x_coordinate, y_coordinate, current_path, start_filling, [])print(paths)
输出：
[[(0, 0), (0, 1), (0, 2), (1, 2), (2, 2)], [(0, 0), (0, 1), (1, 1), (1, 2), (2, 2)], [(0, 0), (1, 0), (1, 1), (1, 2), (2, 2)], [(0, 0), (0, 1), (1, 1), (2, 1), (2, 2)], [(0, 0), (1, 0), (1, 1), (2, 1), (2, 2)], [(0, 0), (1, 0), (2, 0), (2, 1), (2, 2)]]
这里的更正是：
return list_of_lists + [current_path[:]]
我在其中使用添加 副本
current_path[:]
