[LeetCode]90 子集II

题目描述

给定一个可能包含重复元素的整数数组 nums，返回该数组所有可能的子集（幂集）。

说明：解集不能包含重复的子集。

示例:

输入: [1,2,2]
输出:
[
  [2],
  [1],
  [1,2,2],
  [2,2],
  [1,2],
  []
]

代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
from collections import Counter
class Solution:
    def subsetsWithDup(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        if not nums:
            return []
        dic = Counter(nums)
        res = [[]]
        que = [[]]
        print(dic)
        for k in dic:
            tq = []
            for ele in que:
                for i in range(dic[k]):
                    tq.append(ele + [k]*(i+1))
            res += tq
            que = res
        return que