1
class Solution:
2
    def subsetsWithDup(self, nums: List[int]) -> List[List[int]]:
3
        ans = []
4
        nums.sort()
5

6
        def subset(p, up):
7
            if len(up) == 0:
8
                if p not in ans:
9
                    ans.append(p)
10
                return
11
            ch = up[0]
12
            subset(p + [ch], up[1:])
13
            subset(p, up[1:])
14

15
        subset([], nums)
16
        return ans