题目 给定一个没有重复数字的序列,返回其所有可能的全排列。
库函数
def permute(self
, nums
: List
[int]) -> List
[List
[int]]:
return list(itertools
.permutations
(nums
, len(nums
)))
回溯
def permute(self
, nums
):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
def backtrack(first
= 0):
if first
== n
:
output
.append
(nums
[:])
for i
in range(first
, n
):
nums
[first
], nums
[i
] = nums
[i
], nums
[first
]
backtrack
(first
+ 1)
nums
[first
], nums
[i
] = nums
[i
], nums
[first
]
n
= len(nums
)
output
= []
backtrack
()
return output
转载请注明原文地址: https://mac.8miu.com/read-484410.html