defpermutation_n(set,result,n):if n ==0:print(result)return result
for i inrange(len(set)):
permutation_n(set[:i]+set[i+1:],result+set[i],n-1)set=['1','2','3']
permutation_n(set,'',2)
题目给定一个集合,取其排列组合的其中n个思路对集合做全排列,然后取其中n个代码def permutation_n(set,result,n): if n == 0: print(result) return result for i in range(len(set)): permutation_n(set[:i]+set[i+1:],result+set[i],n-1)set = ['1','2','3']permutation_n(set,'',2).