仅在字符串内生成特定字符的排列

def generate_permutations(string):
    # 递归终止条件：当字符串长度为1时，无需再进行排列，直接返回该字符
    if len(string) == 1:
        return [string]

    # 递归步骤：将字符串分为首字符和剩余字符两部分
    first_char = string[0]
    remaining_chars = string[1:]

    # 递归调用，生成剩余字符的排列
    permutations = generate_permutations(remaining_chars)

    # 将首字符插入到每个排列的不同位置，生成新的排列
    new_permutations = []
    for permutation in permutations:
        for i in range(len(permutation) + 1):
            new_permutation = permutation[:i] + first_char + permutation[i:]
            new_permutations.append(new_permutation)

    return new_permutations

# 示例用法
string = "abc"
permutations = generate_permutations(string)
for permutation in permutations:
    print(permutation)

abc
acb
bac
bca
cab
cba