-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.ts
40 lines (33 loc) · 1009 Bytes
/
index.ts
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
/**
* 子集
* @see https://leetcode-cn.com/problems/subsets/
*/
//1,去重,
function subsets(nums: number[]): number[][] {
const result: number[][] = []
const path: number[] = []
//创建一个使用过的数组,标记位置
const used = new Array(nums.length).fill(0)
function backtracking(nums: number[], startIndex: number) {
//都是子集
if (startIndex <= nums.length) {
result.push([...path])
}
//终止条件,找到最后一项
if (startIndex > nums.length) return
for (let i = startIndex; i < nums.length; i++) {
//解决重复问题
if (i > 0 && nums[i] === nums[i - 1] && used[i - 1] === 0) {
continue
}
used[i] = 1
path.push(nums[i])
backtracking(nums, i + 1)
//回溯
used[i] = 0
path.pop()
}
}
backtracking(nums.sort((a, b) => a - b), 0)
return result
};