Skip to content

78. Subsets

Array Backtracking Bit Manipulation

Problem - Subsets

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.

Solutions

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:
        def dfs(i: int):
            if i == len(nums):
                result.append(temp[:])
                return 
            dfs(i + 1)
            temp.append(nums[i])
            dfs(i + 1)
            temp.pop()

        result = []
        temp = []
        dfs(0)

        return result

Submission Stats:

  • Runtime: 0 ms (100.00%)
  • Memory: 18 MB (40.18%)