0047_PermutationsII.py

class Solution(object):
    def permuteUnique(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        result = []
        nums.sort()
        self.dfs(nums,[],result)
        return result
    
    def dfs(self, nums, current, result):
        if len(nums) == 0:
            result.append(current)
        for i in range(len(nums)):
            if i > 0 and nums[i] == nums[i-1]:
                continue
            self.dfs(nums[:i]+nums[i+1:],current + [nums[i]], result)