从左上角到右下角查找所有路径问题。以数组作为参数输出的递归解法说明

def findPaths(grid, row, col):
    # 判断当前位置是否为右下角
    if row == len(grid) - 1 and col == len(grid[0]) - 1:
        return [[(row, col)]]
    
    # 判断当前位置是否为障碍物或超出数组边界
    if row >= len(grid) or col >= len(grid[0]) or grid[row][col] == 1:
        return []
    
    # 向右移动的路径
    right_paths = findPaths(grid, row, col + 1)
    # 向下移动的路径
    down_paths = findPaths(grid, row + 1, col)
    
    # 合并两个方向的路径
    paths = []
    for path in right_paths:
        paths.append([(row, col)] + path)
    for path in down_paths:
        paths.append([(row, col)] + path)
    
    return paths

# 示例输入
grid = [[0, 0, 0], [0, 1, 0], [0, 0, 0]]
# 调用递归函数
paths = findPaths(grid, 0, 0)
# 输出结果
for path in paths:
    print(path)