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],[1,2],[1,2,3],[1,3],[2],[2,3],[3]]
Explanation: The power set of [1,2,3] contains 2³ = 8 subsets, including the empty set and the set itself.
Example 2:
Input: nums = [0]
Output: [[],[0]]
Explanation: The only subsets are the empty set and [0].
1 <= nums.length <= 10-10 <= nums[i] <= 10nums are unique