【LeetCode】78. Subsets

最新推荐文章于 2022-10-22 22:28:31 发布

roguesir

最新推荐文章于 2022-10-22 22:28:31 发布

阅读量609

点赞数

分类专栏： python LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/roguesir/article/details/87990412

版权

python 同时被 2 个专栏收录

72 篇文章 4 订阅

订阅专栏

LeetCode

15 篇文章 0 订阅

订阅专栏

Introduce

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],
  []
]

Solution

class Solution(object):
    def subsets(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        result = [[]]
        for x in nums:
            result.extend([subset + [x] for subset in result])
        return result