递归打印平衡单元格

def print_balanced_cells(matrix, row, col):
    # 检查当前单元格是否平衡
    if is_balanced(matrix, row, col):
        print(f"平衡单元格：({row}, {col})")

    # 递归检查上下左右四个相邻单元格
    if row > 0:
        print_balanced_cells(matrix, row - 1, col)  # 上
    if row < len(matrix) - 1:
        print_balanced_cells(matrix, row + 1, col)  # 下
    if col > 0:
        print_balanced_cells(matrix, row, col - 1)  # 左
    if col < len(matrix[0]) - 1:
        print_balanced_cells(matrix, row, col + 1)  # 右

def is_balanced(matrix, row, col):
    cell_value = matrix[row][col]
    neighbors_sum = 0

    # 计算上下左右四个相邻单元格的值之和
    if row > 0:
        neighbors_sum += matrix[row - 1][col]  # 上
    if row < len(matrix) - 1:
        neighbors_sum += matrix[row + 1][col]  # 下
    if col > 0:
        neighbors_sum += matrix[row][col - 1]  # 左
    if col < len(matrix[0]) - 1:
        neighbors_sum += matrix[row][col + 1]  # 右

    # 判断当前单元格是否平衡
    return cell_value == neighbors_sum

# 示例输入
matrix = [
    [1, 2, 3],
    [4, 9, 6],
    [7, 8, 5]
]

# 调用递归函数
print_balanced_cells(matrix, 0, 0)