Subsets

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]]
Explanation: There are 2^3 = 8 subsets of a 3-element set, including the empty set and the full set.

Example 2

Input: nums = [0]
Output: [[], [0]]
Explanation: A 1-element array has exactly 2 subsets.

---

Constraints

• 1 <= nums.length <= 10
• -10 <= nums[i] <= 10
• All elements of nums are unique.