-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsort_list_test.go
55 lines (45 loc) · 1.06 KB
/
sort_list_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
package problem0148
import (
"fmt"
. "leetcodedaily/helpers/listnode"
"testing"
"github.com/stretchr/testify/assert"
)
type Result struct {
Input *ListNode
Expected *ListNode
}
var Results = []Result{
{MakeListNode(4, 2, 1, 3), MakeListNode(1, 2, 3, 4)},
{MakeListNode(-1, 5, 3, 4, 0), MakeListNode(-1, 0, 3, 4, 5)},
}
func TestSortList(t *testing.T) {
assert := assert.New(t)
for _, res := range Results {
want := CopyList(res.Expected)
got := sortList(CopyList(res.Input))
assert.Equal(want, got, fmt.Sprintf("%+v", res))
}
}
func BenchmarkSortList(b *testing.B) {
for i := 0; i < b.N; i++ {
for _, res := range Results {
sortList(CopyList(res.Input))
}
}
}
func TestSortListInPlace(t *testing.T) {
assert := assert.New(t)
for _, res := range Results {
want := CopyList(res.Expected)
got := sortListInPlace(CopyList(res.Input))
assert.Equal(want, got, fmt.Sprintf("%+v", res))
}
}
func BenchmarkSortListInPlace(b *testing.B) {
for i := 0; i < b.N; i++ {
for _, res := range Results {
sortListInPlace(CopyList(res.Input))
}
}
}