-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain_test.go
59 lines (54 loc) · 1.33 KB
/
main_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
package main
import "testing"
func Test_longestConsecutive(t *testing.T) {
type args struct {
nums []int
}
tests := []struct {
name string
args args
want int
}{
{
name: "example 1",
args: args{nums: []int{100, 4, 200, 1, 3, 2}},
want: 4,
},
{
name: "example 2",
args: args{nums: []int{0, 3, 7, 2, 5, 8, 4, 6, 0, 1}},
want: 9,
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
if got := longestConsecutive(tt.args.nums); got != tt.want {
t.Errorf("longestConsecutive() = %v, want %v", got, tt.want)
}
if got := longestConsecutiveHash(tt.args.nums); got != tt.want {
t.Errorf("longestConsecutiveHash() = %v, want %v", got, tt.want)
}
if got := longestConsecutiveForest(tt.args.nums); got != tt.want {
t.Errorf("longestConsecutiveForest() = %v, want %v", got, tt.want)
}
})
}
}
func Benchmark_longestConsecutive(b *testing.B) {
var nums = []int{0, 3, 7, 2, 5, 8, 4, 6, 0, 1}
for i := 0; i < b.N; i++ {
longestConsecutive(nums)
}
}
func Benchmark_longestConsecutiveHash(b *testing.B) {
var nums = []int{0, 3, 7, 2, 5, 8, 4, 6, 0, 1}
for i := 0; i < b.N; i++ {
longestConsecutiveHash(nums)
}
}
func Benchmark_longestConsecutiveForest(b *testing.B) {
var nums = []int{0, 3, 7, 2, 5, 8, 4, 6, 0, 1}
for i := 0; i < b.N; i++ {
longestConsecutiveForest(nums)
}
}