90. Subsets II (Medium) - TengnanYao/daily_leetcode GitHub Wiki

class Solution(object):
    def subsetsWithDup(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        result = [](/TengnanYao/daily_leetcode/wiki/)
        for num in sorted(nums):
            n = len(result)
            for i in range(n):
                result.append(result[i] + [num])
        return set(tuple(x) for x in result)