78.子集

最新推荐文章于 2024-09-27 15:30:00 发布

Barrett-Feilong

最新推荐文章于 2024-09-27 15:30:00 发布

阅读量49

点赞数

文章标签： leetcode 算法

本文链接：https://blog.csdn.net/weixin_50096533/article/details/116140103

版权

from typing import List

def subsets(nums: List[int]) -> List[List[int]]:
    res = [[]]
    for i in nums:
        a = [[i] + num for num in res]
        print(a)
        res = res + a
        # print(res)
    return res

def subsets2(nums: List[int]) -> List[List[int]]:
        res = []
        n = len(nums)

        def helper(i, tmp):
            res.append(tmp)
            for j in range(i, n):
                helper(j + 1, tmp + [nums[j]])

        helper(0, [])
        return res

print(subsets2([1, 2, 3]))