出處： https://leetcode.com/problems/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]]
Example 2:
Input: nums = [0] Output: [[],[0]]
Constraints:
1 <= nums.length <= 10-10 <= nums[i] <= 10- All the numbers of
numsare unique.
/**
* @param {number[]} nums
* @return {number[][]}
*/
var subsets = function(nums) {
const res = [[]]
for (let i = 0; i < nums.length; i++) {
const _nums = nums.slice(i + 1)
const _res = subsets(_nums)
for (let j = 0; j < _res.length; j++) {
_res[j].unshift(nums[i])
res.push(_res[j])
}
}
return res
};
