(n)
| 33 | |
| 34 | |
| 35 | def fun(n): |
| 36 | if n==2: |
| 37 | return [[1,2],[2,1]] |
| 38 | else: |
| 39 | back=[]#返回集合 |
| 40 | |
| 41 | li_a=a(n) |
| 42 | for i in li_a:#依次取li_a中的每一个 |
| 43 | li_c=c(i,li_a)#生成li_a中除去i的补集 |
| 44 | for one in fun(n-1):#取下一级的所有排列序 |
| 45 | #li=函数(第一位i,补集li_c,序数列表one) |
| 46 | li=form(i,li_c,one) |
| 47 | back.append(li) |
| 48 | |
| 49 | return back |
| 50 | |
| 51 | |
| 52 |
no test coverage detected