動機
經典子集列舉
Problem
Given an integer array nums
of unique elements, return all possible subsets (the power set).
The solution set must not contain duplicate subsets. Return the solution in any order.
Example 1:
Input: nums = [1,2,3]Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]
Example 2:
Input: nums = [0]Output: [[],[0]]
Constraints:
1 <= nums.length <= 10
-10 <= nums[i] <= 10
- All the numbers of
nums
are unique.
Sol
class Solution:
def subsets(self, nums: List[int], i = 0) -> List[List[int]]:
if i == len(nums):
return [[]]
else:
ret = self.subsets(nums,i+1)
return ret+[tup+[nums[i]] for tup in ret]