-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlongest_diff_subseq_test.go
56 lines (46 loc) · 1.13 KB
/
longest_diff_subseq_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
package problem1218
import (
"fmt"
"testing"
"github.com/stretchr/testify/assert"
)
type TestCase struct {
Input []int
Diff int
Expected int
}
var TestCases = []TestCase{
{[]int{1, 2, 3, 4}, 1, 4},
{[]int{1, 3, 5, 7}, 1, 1},
{[]int{1, 5, 7, 8, 5, 3, 4, 2, 1}, -2, 4},
}
func TestLongestArithmeticSubsequenceWithDiff(t *testing.T) {
assert := assert.New(t)
for _, tc := range TestCases {
want := tc.Expected
got := longestSubsequence(tc.Input, tc.Diff)
assert.Equal(want, got, fmt.Sprintf("%+v", tc))
}
}
func BenchmarkLongestArithmeticSubsequenceWithDiff(b *testing.B) {
for i := 0; i < b.N; i++ {
for _, tc := range TestCases {
longestSubsequence(tc.Input, tc.Diff)
}
}
}
func TestLongestArithmeticSubsequenceWithDiffNaive(t *testing.T) {
assert := assert.New(t)
for _, tc := range TestCases {
want := tc.Expected
got := longestSubsequenceNaive(tc.Input, tc.Diff)
assert.Equal(want, got, fmt.Sprintf("%+v", tc))
}
}
func BenchmarkLongestArithmeticSubsequenceWithDiffNaive(b *testing.B) {
for i := 0; i < b.N; i++ {
for _, tc := range TestCases {
longestSubsequenceNaive(tc.Input, tc.Diff)
}
}
}