0,1矩阵中的递归路径查找(并保存所有可能的路径)

def findPaths(matrix, row, col, path, visited, paths):
    # 判断当前位置是否越界或已经访问过
    if row < 0 or row >= len(matrix) or col < 0 or col >= len(matrix[0]) or visited[row][col]:
        return
    
    # 将当前位置标记为已访问
    visited[row][col] = True
    
    # 判断当前位置是否为终点
    if matrix[row][col] == 1:
        # 将当前路径保存起来
        paths.append(path + [(row, col)])
    else:
        # 选择下一个位置进行递归调用
        findPaths(matrix, row + 1, col, path + [(row, col)], visited, paths)
        findPaths(matrix, row - 1, col, path + [(row, col)], visited, paths)
        findPaths(matrix, row, col + 1, path + [(row, col)], visited, paths)
        findPaths(matrix, row, col - 1, path + [(row, col)], visited, paths)
    
    # 恢复当前位置的访问状态
    visited[row][col] = False

# 测试代码
matrix = [[0, 1, 0],
          [0, 0, 1],
          [0, 1, 0]]
visited = [[False] * len(matrix[0]) for _ in range(len(matrix))]
paths = []
findPaths(matrix, 0, 0, [], visited, paths)
print(paths)