每个元素无重复无难度,DFS
class Solution(object):
def permute(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
self.res=[]
def dfs(nums,tmp):
if len(nums) == len(tmp):
self.res.append(tmp[:])
for m in nums:
if m in tmp:
continue
tmp.append(m)
dfs(nums,tmp)
tmp.remove(m)
dfs(nums,[])
return self.res