-
-
Notifications
You must be signed in to change notification settings - Fork 25
/
Copy pathsolution_test.go
119 lines (112 loc) · 1.77 KB
/
solution_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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
package main
import (
"fmt"
"reflect"
"testing"
)
type TestItem struct {
input *ListNode
output *ListNode
}
func TestTask(t *testing.T) {
for i, v := range generateTasks() {
t.Run(fmt.Sprintf("Test %d", i+1), func(t *testing.T) {
res := oddEvenList(v.input)
if !reflect.DeepEqual(res, v.output) {
t.Errorf("Wrong test.\nOutput: \n%v \nExpected: \n%v", getListView(res), getListView(v.output))
}
})
}
}
func generateTasks() []TestItem {
return []TestItem{
{
&ListNode{
Val: 1,
Next: &ListNode{
Val: 2,
Next: &ListNode{
Val: 3,
Next: &ListNode{
Val: 4,
Next: &ListNode{
Val: 5,
Next: nil,
},
},
},
},
},
&ListNode{
Val: 1,
Next: &ListNode{
Val: 3,
Next: &ListNode{
Val: 5,
Next: &ListNode{
Val: 2,
Next: &ListNode{
Val: 4,
Next: nil,
},
},
},
},
},
},
{
&ListNode{
Val: 2,
Next: &ListNode{
Val: 1,
Next: &ListNode{
Val: 3,
Next: &ListNode{
Val: 5,
Next: &ListNode{
Val: 6,
Next: &ListNode{
Val: 4,
Next: &ListNode{
Val: 7,
Next: nil,
},
},
},
},
},
},
},
&ListNode{
Val: 2,
Next: &ListNode{
Val: 3,
Next: &ListNode{
Val: 6,
Next: &ListNode{
Val: 7,
Next: &ListNode{
Val: 1,
Next: &ListNode{
Val: 5,
Next: &ListNode{
Val: 4,
Next: nil,
},
},
},
},
},
},
},
},
}
}
func getListView(node *ListNode) []int {
var res []int
for node != nil {
res = append(res, node.Val)
node = node.Next
}
return res
}