用回溯写了个全排列算法
class Solution:
def permute(self, nums: List[int]) -> List[List[int]]:
res = []
path = []
n = len(nums)
def backtrack(path, num):
if not num:
res.append(path)
return
for i in range(len(num)):
backtrack(path+[num[i]], num[:i] + num[i + 1:])
backtrack(path, nums)
return res