python leetcode 47. Permutations II

注意去重

class Solution(object):
    def permuteUnique(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        nums.sort()
        res=[]
        l=[]
        def dfs(l,pre,nums):
            if len(nums)==0:
                res.append(l[:])
            pre=None 
            for i in range(len(nums)):
                if nums[i]==pre:
                    continue 
                l.append(nums[i])
                dfs(l,nums[i],nums[:i]+nums[i+1:])
                l.pop()
                pre=nums[i]
        dfs(l,None,nums)
        return res