forked from xingyuzhe/javascript-algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path46-permutations.js
More file actions
50 lines (38 loc) · 822 Bytes
/
Copy path46-permutations.js
File metadata and controls
50 lines (38 loc) · 822 Bytes
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
//@STAR
var permute = function(nums) {
return BFS(nums)
};
function BFS(nums) {
if (!nums) return []
if (nums.length <= 1) return [nums]
const l = nums.length
const queue = nums.map(num => [num])
while(queue.some(arr => arr.length < l)) {
const head = queue.shift()
for (const num of nums) {
if (head.includes(num)) continue
queue.push(head.slice(0).concat(num))
}
}
return queue
}
var permute2 = function(nums) {
if (!nums) return []
if (nums.length <= 1) return [nums]
const l = nums.length
const ans = []
DFS([])
return ans
function DFS(cur) {
if (cur.length === l) {
ans.push(cur.slice())
return
}
for (const num of nums) {
if (cur.includes(num)) continue
cur.push(num)
DFS(cur)
cur.pop()
}
}
};