Subsets

Subsets

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

@DFS
class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:
        self.ret = []
        self.generate(nums, 0, [])
        return self.ret
    
    def generate(self, nums, start, temp):
        self.ret.append(temp)
        for i in range(start, len(nums)):
            self.generate(nums, i+1, temp+[nums[i]])