-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.go
42 lines (37 loc) · 1011 Bytes
/
main.go
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
package subsets
// 時間複雜 O(n^2) , 空間複雜 O(n)
func Subsets(nums []int) [][]int {
path, result := []int{}, [][]int{}
for i := 0; i <= len(nums); i++ {
genSubsets(nums, i, 0, path, &result)
}
return result
}
func genSubsets(nums []int, elemSize, start int, path []int, result *[][]int) {
if len(path) == elemSize {
b := make([]int, len(path))
copy(b, path)
*result = append(*result, b)
return
}
for k := start; k < len(nums); k++ {
path = append(path, nums[k])
genSubsets(nums, elemSize, k+1, path, result)
path = path[:len(path)-1]
}
}
// 時間複雜 O(n^2) , 空間複雜 O(n)
func SubsetsDFS(nums []int) [][]int {
path, result := []int{}, [][]int{}
genSubsetsDFS(nums, path, &result)
return result
}
func genSubsetsDFS(nums []int, path []int, result *[][]int) {
b := make([]int, len(path))
copy(b, path)
*result = append(*result, b)
for i := 0; i < len(nums); i++ {
// n個 element 在slice中
genSubsetsDFS(nums[i+1:], append(path, nums[i]), result)
}
}