-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathwiggle-subsequence-test.cpp
78 lines (68 loc) · 2.22 KB
/
wiggle-subsequence-test.cpp
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
/*
* Copyright (c) 2018 Christopher Friedt
*
* SPDX-License-Identifier: MIT
*/
#include <gtest/gtest.h>
#include "wiggle-subsequence.cpp"
// this tests out the entire sequence being a wiggle
TEST(WiggleSubsequence, Test_1_7_4_9_2_5) {
vector<int> nums({1, 7, 4, 9, 2, 5});
int expected_int = 6;
int actual_int = Solution().wiggleMaxLength(nums);
EXPECT_EQ(actual_int, expected_int);
}
// this tests out an even sequence being the longest
TEST(WiggleSubsequence, Test_1_17_5_10_13_15_10_5_16_8) {
vector<int> nums({1, 17, 5, 10, 13, 15, 10, 5, 16, 8});
int expected_int = 7;
int actual_int = Solution().wiggleMaxLength(nums);
EXPECT_EQ(actual_int, expected_int);
}
// this tests out 0 wiggles
TEST(WiggleSubsequence, Test_nil) {
vector<int> nums;
int expected_int = 0;
int actual_int = Solution().wiggleMaxLength(nums);
EXPECT_EQ(actual_int, expected_int);
}
// this tests out length 1 vectors wiggles
TEST(WiggleSubsequence, Test_1) {
vector<int> nums({1});
int expected_int = 1;
int actual_int = Solution().wiggleMaxLength(nums);
EXPECT_EQ(actual_int, expected_int);
}
// this tests out 0 wiggles, technically. For some reason, they count this as
// wiggle subsequence length == 1
TEST(WiggleSubsequence, Test_0_0) {
vector<int> nums({0, 0});
int expected_int = 1;
int actual_int = Solution().wiggleMaxLength(nums);
EXPECT_EQ(actual_int, expected_int);
}
// this tests out the case where only 1 wiggle is seen but no more after that
TEST(WiggleSubsequence, Test_0_1_1) {
vector<int> nums({0, 1, 1});
int expected_int = 2;
int actual_int = Solution().wiggleMaxLength(nums);
EXPECT_EQ(actual_int, expected_int);
}
// this tests out an odd sequence being the longest
TEST(WiggleSubsequence, Test_1_0_1_0_1_0) {
// nums 1,0,1,0,1,0
// d -,+,-,+,-
// even 1,1,2,3,4,5
// odd 1,2,3,4,5,6
vector<int> nums({1, 0, 1, 0, 1, 0});
int expected_int = 6;
int actual_int = Solution().wiggleMaxLength(nums);
EXPECT_EQ(actual_int, expected_int);
}
// this tests out not setting the initial sign_last properly
TEST(WiggleSubsequence, Test_3_3_3_2_5) {
vector<int> nums({3, 3, 3, 2, 5});
int expected_int = 3;
int actual_int = Solution().wiggleMaxLength(nums);
EXPECT_EQ(actual_int, expected_int);
}