获取不带子组合的任意长度的所有组合

def getCombinations(elements, length, start=0):
    result = []
    if length == 0:
        return [[]]  # 返回一个空组合
    for i in range(start, len(elements)):
        current = elements[i]
        # 递归获取长度为length-1的组合
        sub_combinations = getCombinations(elements, length - 1, i + 1)
        # 将当前元素与子组合进行组合
        for sub_combination in sub_combinations:
            result.append([current] + sub_combination)
    return result

elements = [1, 2, 3, 4]
length = 2
combinations = getCombinations(elements, length)

for combination in combinations:
    print(combination)