重写创建具有固定和的数字组合的函数作为生成器

def generate_combinations(target_sum, combination_length):
    # 递归函数，用于生成数字组合
    def generate_combinations_recursive(current_combination, remaining_length, remaining_sum):
        # 递归终止条件
        if remaining_length == 0:
            # 当组合长度为0时，检查数字之和是否等于目标和
            if remaining_sum == 0:
                yield current_combination  # 使用yield关键字将结果作为生成器的一部分返回
            return
        
        # 递归生成数字组合
        for digit in range(10):
            # 尝试添加当前数字到组合中
            new_combination = current_combination + [digit]
            new_sum = remaining_sum - digit
            new_length = remaining_length - 1
            yield from generate_combinations_recursive(new_combination, new_length, new_sum)

    # 调用递归函数并返回生成器对象
    return generate_combinations_recursive([], combination_length, target_sum)

# 生成目标和为5，长度为3的数字组合
combinations = generate_combinations(5, 3)

# 遍历生成器并打印结果
for combination in combinations:
    print(combination)

[0, 2, 3]
[0, 3, 2]
[1, 1, 3]
[1, 2, 2]
[1, 3, 1]
[2, 0, 3]
[2, 1, 2]
[2, 2, 1]
[2, 3, 0]
[3, 0, 2]
[3, 1, 1]
[3, 2, 0]