81/300
- 子集
给定一组不含重复元素的整数数组 nums,返回该数组所有可能的子集(幂集)。
说明:解集不能包含重复的子集。
示例:
输入: nums = [1,2,3]
输出:
[
[3],
[1],
[2],
[1,2,3],
[1,3],
[2,3],
[1,2],
[]
]
思路1: 直接用python求集合的子集和子集个数
class Solution:
def subsets_01(self, nums: List[int]) -> List[List[int]]:
return [ _ for i in range(len(nums)+1) for _ in itertools.combinations(nums, i)]
思路2:
n = 1
[[], [1]]
n = 2
[[], [1], [2], [1, 2]]
n = 3
[[], [1], [2], [1, 2], [3], [1, 3], [2, 3], [1, 2, 3]]
def subsets_02(self, nums: List[int]) -> List[List[int]]:
lst = [[]]
for n in nums:
lst += [s + [n] for s in lst]
return lst