以递归方式生成列表的所有可能排列

def permutations(lst):
    if not lst:
        return []
    else:
        return [lst[i] for i in range(len(lst))]

def permutations_recursive(lst):
    if not lst:
        return []
    else:
        return [lst[i] for i in range(len(lst))]

def generate_permutations(lst):
    result = []
    for i in range(len(lst)):
        for j in range(i+1, len(lst)):
            result.append(lst[i] + lst[j])
    return result

lst = [1, 2, 3]
permutations = permutations_recursive(lst)
print(permutations)

permutations = generate_permutations(lst)
print(permutations)

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