backtrackingsubsets
Subsets (Power Set)
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]]
Constraints
1 <= nums.length <= 10-10 <= nums[i] <= 10- All numbers of
numsare unique.
Loading workspace editor...
Ready to run
Input:
{
"nums": [
1,
2,
3
]
}Expected Output:
[
[],
[
1
],
[
1,
2
],
[
1,
2,
3
],
[
1,
3
],
[
2
],
[
2,
3
],
[
3
]
]