Subsets

class Solution:
    def __init__(self):
        self.path = []
        self.res = []

    def backtrack(self, nums, startIndex):
        self.res.append(self.path.copy())
        for i in range(startIndex, len(nums)):
            num = nums[i]
            self.path.append(num)
            self.backtrack(nums, i + 1)
            self.path.pop()
        return None


    def subsets(self, nums: List[int]) -> List[List[int]]:
        self.backtrack(nums, 0)
        return self.res

Subsets

Difficulty: Medium

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.