列出1 ... n之间k个整数的所有可能组合(n选择k)

def combination(n, k):
    if k == 0 or k == n:
        return [[]]
    else:
        result = []
        for i in range(1, n+1):
            for subset in combination(n-i, k-1):
                result.append([i] + subset)
        return result

n = 5  # 可以根据需要更改n和k的值
k = 3
print(combination(n, k))

[[1, 2, 3], [1, 2, 4], [1, 2, 5], [1, 3, 4], [1, 3, 5], [1, 4, 5], [2, 3, 4], [2, 3, 5], [2, 4, 5], [3, 4, 5]]