78. Subsets Medium
Description
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],
[]
]
题意
求出给定数组的所有子集和,要求结果没有重复子集。
解题思路
这题一看到就想到用动态规划了,先看成单个的小问题,为空时返回[[]], 单个值时返回[[],nums],其他情况可以看作是这两种情况的组合。
code
class Solution:
def subsets(self, nums: List[int]) -> List[List[int]]:
return self.dp_subsets(nums)
def dp_subsets(self,nums):
if nums == []:
return [[]]
if len(nums) == 1:
return [[],nums]
head = nums[0]
tail = nums[1:]
sub_tail = self.dp_subsets(tail)
res = []
for value in sub_tail:
res.append(value)
temp = list(value)
temp.append(head)
res.append(temp)
return res