-
Notifications
You must be signed in to change notification settings - Fork 8
/
permutations-ii.js
51 lines (46 loc) · 1.01 KB
/
permutations-ii.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
// Given a collection of numbers that might contain duplicates, return all possible unique permutations.
//
// Example:
//
//
// Input: [1,1,2]
// Output:
// [
// [1,1,2],
// [1,2,1],
// [2,1,1]
// ]
//
//
/**
* @param {number[]} nums
* @return {number[][]}
*/
var permuteUnique = function(nums) {
var len = nums.length,
result = [],
used = new Array(len),
temp = new Array(len);
var _permuteUnique = function(i) {
if (i >= len) {
var r = [].concat(temp);
result.push(r);
return ;
}
var map = {};
for (var j = 0;j < len;++j) {
if (used[j]) {
continue;
}
if (!map[nums[j]]) {
used[j] = true;
temp[i] = nums[j];
_permuteUnique(i + 1);
used[j] = 0;
map[nums[j]] = 1;
}
}
};
_permuteUnique(0);
return result;
};