leetcode刷题python之子集2

class Solution:
    def subsetsWithDup(self, nums: List[int]) -> List[List[int]]:
        nums.sort()
        result = []
        def backtrack(j,tmp):
            result.append(tmp)
            for i in range(j, len(nums)):
                if i > j and nums[i] == nums[i - 1]:
                    continue
                backtrack(i+1, tmp + [nums[i]])
        backtrack(0 , [])
        return result