按照顺序生成全排列——基于python切片

def total_arrange(base_list: list, length: int, cur_list: list):
    if length == 0:
        print("".join(list(map(str, cur_list))))
        return
    for i in range(length):
        cur_list.append(base_list[i])
        total_arrange(base_list[0:i] + base_list[i+1:], length-1, cur_list)
        cur_list.pop(-1)

def func():
    n = int(input().strip())
    
    base_list = list(range(1, n+1))
    total_arrange(base_list, n, [])

    
if __name__ == "__main__":
    func()