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]]
Solution
class Solution:
def subsets(self, nums: List[int]) -> List[List[int]]:
out = []
subsets = []
def backtrack(i):
if i >= len(nums):
out.append(subsets.copy())
return
subsets.append(nums[i])
backtrack(i + 1)
subsets.pop()
backtrack(i + 1)
backtrack(0)
return out