-
Notifications
You must be signed in to change notification settings - Fork 85
/
Permutations_Without_Duplicates.js
45 lines (38 loc) · 918 Bytes
/
Permutations_Without_Duplicates.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
/*
Permutations withuot duplicates
https://leetcode.com/problems/permutations/description/
Given a collection of distinct integers, return all possible permutations.
Example:
Input: [1,2,3]
Output:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]
*/
// Permutations without Duplicates
var subsetWithoutDuplicates = function (nums) {
if (nums.lenght == 0) {
return;
}
var solution = [];
subsetWithoutDuplicatesAux(nums, [], solution);
return solution;
};
var subsetWithoutDuplicatesAux = function (nums, current, sol) {
if (nums.length == 0) {
sol.push(current);
}
for (var i = 0; i < nums.length; i++) {
var newCurrent = [...current, nums[i]];
var newNums = nums.filter(function (num, index) {
return index !== i;
});
subsetWithoutDuplicatesAux(newNums, newCurrent, sol);
}
};
module.exports.subsetWithoutDuplicates = subsetWithoutDuplicates;