算法-目录
题目来源: 剑指 Offer II 083. 没有重复元素集合的全排列、BM55 没有重复项数字的全排列
回溯、深搜
class Solution:
def permute(self , nums ):
# write code here
res = []
path = []
def dfs(path,nums):
if not nums:
res.append(path)
for i in range(len(nums)):
dfs(path+[nums[i]],nums[:i]+nums[i+1:])
dfs(path,nums)
return res