Subsets

Medium

Given an array nums of unique integers, return all possible subsets (the power set). The result may be in any order; this judge compares them order-independently.

Example 1

Input:  nums = [1,2,3]
Output: [[],[1],[2],[3],[1,2],[1,3],[2,3],[1,2,3]]

Example 2

Input:  nums = [0]
Output: [[],[0]]

Constraints

• 1 <= nums.length <= 10
• All numbers are unique.