class Solution:
    def subsetsWithDup(self, nums: 'List[int]') -> 'List[List[int]]':
        nums = sorted(nums)

        def solve(nums):

            if nums == []:
                return [[]]

            count_head = 0
            for n in nums:
                if n == nums[0]:
                    count_head +=1
                else:
                    break


            rest = solve(nums[count_head:])

            ans = []
            for r in rest:
                for i in range(count_head+1):
                    rr = r[::]
                    ans.append(rr + ([nums[0]]*i))

            return ans

        return solve(nums)