Acwing 823. 排列 字典序

标题

n=int(input())
path = [0 for i in range(n)]
st=[False for i in range(n)]

def dfs(u):
    if u==n:
        for x in path:
            print(x+1,end = " ")
        print()
            
    else:
        for i in range(n):
            if not st[i]:
                path[u]=i
                st[i]=True
                dfs(u+1)
                st[i]=False
                path[u]=0
                
dfs(0)