【python3】leetcode 78. Subsets (Medium)

最新推荐文章于 2021-11-04 10:54:07 发布

momottyy

最新推荐文章于 2021-11-04 10:54:07 发布

阅读量213

点赞数

分类专栏： leetcode python

本文链接：https://blog.csdn.net/maotianyi941005/article/details/85912913

版权

leetcode 同时被 2 个专栏收录

126 篇文章 0 订阅

订阅专栏

python

120 篇文章 0 订阅

订阅专栏

78. Subsets

Given a set of distinct integers, nums, return all possible subsets (the power set).

Note: The solution set must not contain duplicate subsets.

Example:
Input: nums = [1,2,3]
Output:
[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

这道题是90题的简单版题目给的数字不重复，所以遍历nums，每个数字和之前的subsets拼接就好了

class Solution:
    def subsets(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        subsets = [[]]

        for k,x in enumerate(nums):
            newsets = [preset+[x] for preset in subsets]
            subsets.extend(newsets)
        return subsets