Subsets II

最新推荐文章于 2022-05-07 14:28:24 发布

真水壶

最新推荐文章于 2022-05-07 14:28:24 发布

阅读量476

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/enjoyuseless/article/details/39961339

版权

leetcode 专栏收录该内容

154 篇文章 0 订阅

订阅专栏

Given a collection of integers that might contain duplicates, S, return all possible subsets.

Note:

Elements in a subset must be in non-descending order.
The solution set must not contain duplicate subsets.

For example,
If S = [1,2,2], a solution is:

[
  [2],
  [1],
  [1,2,2],
  [2,2],
  [1,2],
  []
]

class Solution:
    # @param num, a list of integer
    # @return a list of lists of integer
    def subsetsWithDup(self, S):
        S.sort()
        ret=[]
        for i in range(1<<len(S)):
            unit=[]
            for flag in range(len(S)):
                if ((1<<flag) & i) !=0:
                    unit.append(S[flag])
            if unit not in ret:
                ret.append(unit)
        return ret