forked from halfrost/LeetCode-Go
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path18. 4Sum_test.go
63 lines (50 loc) · 1.21 KB
/
18. 4Sum_test.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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
package leetcode
import (
"fmt"
"testing"
)
type question18 struct {
para18
ans18
}
// para 是参数
// one 代表第一个参数
type para18 struct {
a []int
t int
}
// ans 是答案
// one 代表第一个答案
type ans18 struct {
one [][]int
}
func Test_Problem18(t *testing.T) {
qs := []question18{
question18{
para18{[]int{1, 1, 1, 1}, 4},
ans18{[][]int{[]int{1, 1, 1, 1}}},
},
question18{
para18{[]int{0, 1, 5, 0, 1, 5, 5, -4}, 11},
ans18{[][]int{[]int{-4, 5, 5, 5}, []int{0, 1, 5, 5}}},
},
question18{
para18{[]int{1, 0, -1, 0, -2, 2}, 0},
ans18{[][]int{[]int{-1, 0, 0, 1}, []int{-2, -1, 1, 2}, []int{-2, 0, 0, 2}}},
},
question18{
para18{[]int{1, 0, -1, 0, -2, 2, 0, 0, 0, 0}, 0},
ans18{[][]int{[]int{-1, 0, 0, 1}, []int{-2, -1, 1, 2}, []int{-2, 0, 0, 2}, []int{0, 0, 0, 0}}},
},
question18{
para18{[]int{1, 0, -1, 0, -2, 2, 0, 0, 0, 0}, 1},
ans18{[][]int{[]int{-1, 0, 0, 2}, []int{-2, 0, 1, 2}, []int{0, 0, 0, 1}}},
},
}
fmt.Printf("------------------------Leetcode Problem 18------------------------\n")
for _, q := range qs {
_, p := q.ans18, q.para18
fmt.Printf("【input】:%v 【output】:%v\n", p, fourSum(p.a, p.t))
}
fmt.Printf("\n\n\n")
}