AcWing 1537. 递归实现排列类型枚举 II
原题链接
简单
作者:
弦之森.py
,
2023-11-18 18:29:18
,
所有人可见
,
阅读 35
n=int(input())
nums=list(map(int,input().split()))
# print(nums)
nums.insert(0,0)
dnums=[0 for x in range(n+1)]
array=[0 for x in range(n+1)]
allthing=[]
def dfs(x):
if x>n:
strs=''
for z in range(1,n+1):
strs+=str(array[z])+' '
allthing.append(strs)
return
for y in range(1,n+1):
if dnums[y]==0:
dnums[y]=1
array[x]=nums[y]
dfs(x+1)
dnums[y]=0
array[x]=0
dfs(1)
# print(allthing)
for x in sorted(list(set(allthing))):
print(x)