-
Notifications
You must be signed in to change notification settings - Fork 0
/
subsets.js
63 lines (44 loc) · 1.15 KB
/
subsets.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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
var subsets = function (nums) {
let result = [];
const backtracking = (index, arr) => {
if (index === nums.length) {
result.push([...arr]);
return;
}
arr.push(nums[index]);
backtracking(index + 1, arr);
arr.pop();
backtracking(index + 1, arr);
};
backtracking(0, []);
return result;
};
// Given an integer array nums that may contain duplicates, 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,2]
// Output: [[],[1],[1,2],[1,2,2],[2],[2,2]]
// Example 2:
// Input: nums = [0]
// Output: [[],[0]]
var subsetsII = function(nums) {
const sorted = nums.sort((a,b) => a - b)
const output = []
const backtracking = (arr, idx) => {
if(idx >= sorted.length){
output.push([...arr])
return
}
arr.push(sorted[idx])
backtracking(arr, idx + 1)
arr.pop()
while (idx < sorted.length - 1 && sorted[idx] === sorted[idx + 1]) {
idx += 1
}
backtracking(arr, idx + 1)
}
backtracking([], 0)
return output
};