LeetCode 90 SubsetsII (Python详解及实现)

最新推荐文章于 2022-07-02 13:42:53 发布

toplatona

最新推荐文章于 2022-07-02 13:42:53 发布

阅读量961

点赞数

分类专栏： LeetCode(Python) 文章标签： LeetCode Python

本文链接：https://blog.csdn.net/yangjingjing9/article/details/77012254

版权

LeetCode(Python) 专栏收录该内容

39 篇文章 0 订阅

订阅专栏

【题目】

Given a collection of integers that mightcontain duplicates, nums, return all possible subsets.

Note: The solution set must not containduplicate subsets.

For example,

If nums = [1,2,2], a solution is:

[

[2],

[1],

[1,2,2],

[2,2],

[1,2],

[]

]

【思路】

是78 题subsets的升级，集合中加入了重复元素，这样可以判断集合中是否已有当前子集，若无则将该子集加入到res中

【Python实现】

【题目】
Given a collection of integers that might contain duplicates, nums, return all possible subsets.

Note: The solution set must not contain duplicate subsets.

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

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


【思路】
是78 题subsets的升级，集合中加入了重复元素，这样可以判断集合中是否已有当前子集，若无则将该子集加入到res中


【Python实现】
# -*- coding: utf-8 -*-
"""
Created on Wed Aug  9 19:21:31 2017

@author: Administrator
"""

class Solution(object):
    def subsetsWithDup(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        def dfs(depth, start, valuelist):
            if valuelist  not in res:
                res.append(valuelist)
            if depth == len(nums):
                return
            for i in range(start, len(nums)):
                dfs(depth+1, i+1, valuelist+[nums[i]])
        nums.sort()
        res = []
        dfs(0, 0, [])
        print(res)
        return res
    
if __name__ == '__main__':
    S= Solution()
    
    S.subsetsWithDup([1,2,2])