-
Notifications
You must be signed in to change notification settings - Fork 0
/
subset.js
40 lines (37 loc) · 1.05 KB
/
subset.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
/**
* 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.
*/
/**
* @param {number[]} nums
* @return {number[][]}
*/
var subsets = function(nums) {
let result = [[]];
if (!nums.length) return result;
for (let i = 0; i < nums.length; i++) {
powersetCreator(nums[i]);
}
function powersetCreator(num) {
let currentResult = []
for (let i = 0; i < result.length; i++) {
console.log({ result, num }, JSON.stringify(result))
currentResult.push([...result[i], num]);
}
result.push(...currentResult);
}
return result;
};
// leetcode solution
var subsets = function(nums) {
let res = [[nums[0]]];
for (let i = 1; i < nums.length; i++) {
let curr = nums[i];
res.forEach(a => res.push([...a, curr]));
res.push([curr]);
}
res.unshift([]);
return res;
};
console.log(subsets([1,2,3])); // [[], [1], [2], [1,2], [3], [1,3], [2,3], [1,2,3]]