#78

Subsets

pupil · 410 · lc medium +25 · verified · 82.1% accepted · 19,095 likes · top 93%

Description

Given integer array nums of unique elements, return all possible subsets (the power set). No duplicate subsets are allowed; results may be 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]]

Code

1

2

3

class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:

class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]: