forked from wufenggirl/LeetCode-in-Golang
-
Notifications
You must be signed in to change notification settings - Fork 0
/
intersection-of-two-linked-lists_test.go
executable file
·83 lines (65 loc) · 1.26 KB
/
intersection-of-two-linked-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
package problem0160
import (
"testing"
"github.com/aQuaYi/LeetCode-in-Go/kit"
"github.com/stretchr/testify/assert"
)
// tcs is testcase slice
var tcs = []struct {
a, b []int
ea, eb int
}{
{
[]int{4, 1, 8, 4, 5},
[]int{5, 0, 1, 8, 4, 5},
2,
3,
},
{
[]int{0, 9, 1, 2, 4},
[]int{3, 2, 4},
3,
1,
},
{
[]int{2, 6, 4},
[]int{1, 5},
3,
2,
},
// 可以有多个 testcase
}
// head must Not be nil
func tailOf(head *ListNode) *ListNode {
for head.Next != nil {
head = head.Next
}
return head
}
func Test_getIntersectionNode(t *testing.T) {
ast := assert.New(t)
for _, tc := range tcs {
tail := kit.Ints2List(tc.a[tc.ea:])
headA := kit.Ints2List(tc.a[:tc.ea])
tailA := tailOf(headA)
tailA.Next = tail
headB := kit.Ints2List(tc.b[:tc.eb])
tailB := tailOf(headB)
tailB.Next = tail
ast.Equal(tail, getIntersectionNode(headA, headB), "输入:%v", tc)
}
}
func Benchmark_getIntersectionNode(b *testing.B) {
for i := 0; i < b.N; i++ {
for _, tc := range tcs {
tail := kit.Ints2List(tc.a[tc.ea:])
headA := kit.Ints2List(tc.a[:tc.ea])
tailA := tailOf(headA)
tailA.Next = tail
headB := kit.Ints2List(tc.b[:tc.eb])
tailB := tailOf(headB)
tailB.Next = tail
getIntersectionNode(headA, headB)
}
}
}