Description
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.
Examples
Input:
nums = [1,2,3]Output:
[[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]Explanation:
For n=3 elements, there are 2^3 = 8 possible subsets: empty set, three single-element sets, three two-element sets, and one set with all elements.
Input:
nums = [0]Output:
[[],[0]]Explanation:
Two subsets: empty and [0].
Input:
nums = [-1,0,1]Output:
[[],[-1],[0],[-1,0],[1],[-1,1],[0,1],[-1,0,1]]Explanation:
All possible subsets of [-1,0,1], including negative numbers, zero, and positive numbers. This demonstrates that the algorithm works with mixed positive and negative values.
Constraints
- •
1 ≤ nums.length ≤ 10 - •
-10 ≤ nums[i] ≤ 10 - •
All the numbers of nums are unique.