forked from halfrost/LeetCode-Go
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path23. Merge k Sorted Lists_test.go
104 lines (87 loc) · 1.64 KB
/
23. Merge k Sorted Lists_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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
package leetcode
import (
"fmt"
"testing"
"github.com/halfrost/LeetCode-Go/structures"
)
type question23 struct {
para23
ans23
}
// para 是参数
// one 代表第一个参数
type para23 struct {
one [][]int
}
// ans 是答案
// one 代表第一个答案
type ans23 struct {
one []int
}
func Test_Problem23(t *testing.T) {
qs := []question23{
question23{
para23{[][]int{}},
ans23{[]int{}},
},
question23{
para23{[][]int{
[]int{1},
[]int{1},
}},
ans23{[]int{1, 1}},
},
question23{
para23{[][]int{
[]int{1, 2, 3, 4},
[]int{1, 2, 3, 4},
}},
ans23{[]int{1, 1, 2, 2, 3, 3, 4, 4}},
},
question23{
para23{[][]int{
[]int{1, 2, 3, 4, 5},
[]int{1, 2, 3, 4, 5},
}},
ans23{[]int{1, 1, 2, 2, 3, 3, 4, 4, 5, 5}},
},
question23{
para23{[][]int{
[]int{1},
[]int{9, 9, 9, 9, 9},
}},
ans23{[]int{1, 9, 9, 9, 9, 9}},
},
question23{
para23{[][]int{
[]int{9, 9, 9, 9, 9},
[]int{1},
}},
ans23{[]int{1, 9, 9, 9, 9, 9}},
},
question23{
para23{[][]int{
[]int{2, 3, 4},
[]int{4, 5, 6},
}},
ans23{[]int{2, 3, 4, 4, 5, 6}},
},
question23{
para23{[][]int{
[]int{1, 3, 8},
[]int{1, 7},
}},
ans23{[]int{1, 1, 3, 7, 8}},
},
// 如需多个测试,可以复制上方元素。
}
fmt.Printf("------------------------Leetcode Problem 23------------------------\n")
for _, q := range qs {
var ls []*ListNode
for _, qq := range q.para23.one {
ls = append(ls, structures.Ints2List(qq))
}
fmt.Printf("【input】:%v 【output】:%v\n", q.para23.one, structures.List2Ints(mergeKLists(ls)))
}
fmt.Printf("\n\n\n")
}