import copy
def backTrack(l,t,res):
if len(l) == len(t):
print(res)
res.append(copy.deepcopy(t))
else:
for i in range(n):
if l[i] in t:
continue
else:
t.append(l[i])
backTrack(l,t,res)
t.pop()
n = 3
k = 3
l = [ i for i in range(1,n+1)]
t = []
res = []
backTrack(l,t,res)
print(res)
python 回溯法求排列
最新推荐文章于 2022-07-15 19:08:58 发布