Skip to content

Commit 74dc61a

Browse files
fishercoder1534fishercoder1534
committed
refactor 376
1 parent 54a66f2 commit 74dc61a

File tree

2 files changed

+92
-62
lines changed

2 files changed

+92
-62
lines changed

‎src/main/java/com/fishercoder/solutions/_376.java

Lines changed: 16 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -34,23 +34,23 @@ Can you do it in O(n) time?
3434
*/
3535
public class _376 {
3636

37-
/**credit: https://leetcode.com/articles/wiggle-subsequence/#approach-5-greedy-approach-accepted*/
38-
public int wiggleMaxLength(int[] nums) {
39-
if (nums.length < 2) {
40-
return nums.length;
41-
}
42-
int prevDiff = nums[1] - nums[0];
43-
int count = (prevDiff != 0) ? 2 : 1;
44-
for (int i = 2; i < nums.length; i++) {
45-
int diff = nums[i] - nums[i - 1];
46-
/**ATTN: prevDiff could be zero. e.g. [3,3,3,2,5]
47-
* but diff needs to exactly greater than zero*/
48-
if ((prevDiff <= 0 && diff > 0) || (prevDiff >= 0) && diff < 0) {
49-
count++;
50-
prevDiff = diff;
37+
public static class Solution1 {
38+
public int wiggleMaxLength(int[] nums) {
39+
if (nums.length < 2) {
40+
return nums.length;
41+
}
42+
int prevDiff = nums[1] - nums[0];
43+
int count = (prevDiff != 0) ? 2 : 1;
44+
for (int i = 2; i < nums.length; i++) {
45+
int diff = nums[i] - nums[i - 1];
46+
/**ATTN: prevDiff could be zero. e.g. [3,3,3,2,5]
47+
* but diff needs to exactly greater than zero*/
48+
if ((prevDiff <= 0 && diff > 0) || (prevDiff >= 0) && diff < 0) {
49+
count++;
50+
prevDiff = diff;
51+
}
5152
}
53+
return count;
5254
}
53-
return count;
5455
}
55-
5656
}

‎src/test/java/com/fishercoder/_376Test.java

Lines changed: 76 additions & 46 deletions
Original file line numberDiff line numberDiff line change
@@ -6,51 +6,81 @@
66

77
import static org.junit.Assert.assertEquals;
88

9-
/**
10-
* Created by stevesun on 6/11/17.
11-
*/
129
public class _376Test {
13-
private static _376 test;
14-
private static int[] nums;
15-
16-
@BeforeClass
17-
public static void setup() {
18-
test = new _376();
19-
}
20-
21-
@Test
22-
public void test1() {
23-
nums = new int[]{1, 7, 4, 9, 2, 5};
24-
assertEquals(6, test.wiggleMaxLength(nums));
25-
}
26-
27-
@Test
28-
public void test2() {
29-
nums = new int[]{1, 17, 5, 10, 13, 15, 10, 5, 16, 8};
30-
assertEquals(7, test.wiggleMaxLength(nums));
31-
}
32-
33-
@Test
34-
public void test3() {
35-
nums = new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9};
36-
assertEquals(2, test.wiggleMaxLength(nums));
37-
}
38-
39-
@Test
40-
public void test4() {
41-
nums = new int[]{33, 53, 12, 64, 50, 41, 45, 21, 97, 35, 47, 92, 39, 0, 93, 55, 40, 46, 69, 42, 6, 95, 51, 68, 72, 9, 32, 84, 34, 64, 6, 2, 26, 98, 3, 43, 30, 60, 3, 68, 82, 9, 97, 19, 27, 98, 99, 4, 30, 96, 37, 9, 78, 43, 64, 4, 65, 30, 84, 90, 87, 64, 18, 50, 60, 1, 40, 32, 48, 50, 76, 100, 57, 29, 63, 53, 46, 57, 93, 98, 42, 80, 82, 9, 41, 55, 69, 84, 82, 79, 30, 79, 18, 97, 67, 23, 52, 38, 74, 15};
42-
assertEquals(67, test.wiggleMaxLength(nums));
43-
}
44-
45-
@Test
46-
public void test5() {
47-
nums = new int[]{3, 3, 3, 2, 5};
48-
assertEquals(3, test.wiggleMaxLength(nums));
49-
}
50-
51-
@Test
52-
public void test6() {
53-
nums = new int[]{372, 492, 288, 399, 81, 2, 320, 94, 416, 469, 427, 117, 265, 357, 399, 456, 496, 337, 355, 219, 475, 295, 457, 350, 490, 470, 281, 127, 131, 36, 430, 412, 442, 174, 128, 253, 1, 56, 306, 295, 340, 73, 253, 130, 259, 223, 14, 79, 409, 384, 209, 151, 317, 441, 156, 275, 140, 224, 128, 250, 290, 191, 161, 472, 477, 125, 470, 230, 321, 5, 311, 23, 27, 248, 138, 284, 215, 356, 320, 194, 434, 136, 221, 273, 450, 440, 28, 179, 36, 386, 482, 203, 24, 8, 391, 21, 500, 484, 135, 348, 292, 396, 145, 443, 406, 61, 212, 480, 455, 78, 309, 318, 84, 474, 209, 225, 177, 356, 227, 263, 181, 476, 478, 151, 494, 395, 23, 114, 395, 429, 450, 247, 245, 150, 354, 230, 100, 172, 454, 155, 189, 33, 290, 187, 443, 123, 59, 358, 241, 141, 39, 196, 491, 381, 157, 157, 134, 431, 295, 20, 123, 118, 207, 199, 317, 188, 267, 335, 315, 308, 115, 321, 56, 52, 253, 492, 97, 374, 398, 272, 74, 206, 109, 172, 471, 55, 452, 452, 329, 367, 372, 252, 99, 62, 122, 287, 320, 325, 307, 481, 316, 378, 87, 97, 457, 21, 312, 249, 354, 286, 196, 43, 170, 500, 265, 253, 19, 480, 438, 113, 473, 247, 257, 33, 395, 456, 246, 310, 469, 408, 112, 385, 53, 449, 117, 122, 210, 286, 149, 20, 364, 372, 71, 26, 155, 292, 16, 72, 384, 160, 79, 241, 346, 230, 15, 427, 96, 95, 59, 151, 325, 490, 223, 131, 81, 294, 18, 70, 171, 339, 14, 40, 463, 421, 355, 123, 408, 357, 202, 235, 390, 344, 198, 98, 361, 434, 174, 216, 197, 274, 231, 85, 494, 57, 136, 258, 134, 441, 477, 456, 318, 155, 138, 461, 65, 426, 162, 90, 342, 284, 374, 204, 464, 9, 280, 391, 491, 231, 298, 284, 82, 417, 355, 356, 207, 367, 262, 244, 283, 489, 477, 143, 495, 472, 372, 447, 322, 399, 239, 450, 168, 202, 89, 333, 276, 199, 416, 490, 494, 488, 137, 327, 113, 189, 430, 320, 197, 120, 71, 262, 31, 295, 218, 74, 238, 169, 489, 308, 300, 260, 397, 308, 328, 267, 419, 84, 357, 486, 289, 312, 230, 64, 468, 227, 268, 28, 243, 267, 254, 153, 407, 399, 346, 385, 77, 297, 273, 484, 366, 482, 491, 368, 221, 423, 107, 272, 98, 309, 426, 181, 320, 77, 185, 382, 478, 398, 476, 22, 328, 450, 299, 211, 285, 62, 344, 484, 395, 466, 291, 487, 301, 407, 28, 295, 36, 429, 99, 462, 240, 124, 261, 387, 30, 362, 161, 156, 184, 188, 99, 377, 392, 442, 300, 98, 285, 312, 312, 365, 415, 367, 105, 81, 378, 413, 43, 326, 490, 320, 266, 390, 53, 327, 75, 332, 454, 29, 370, 392, 360, 1, 335, 355, 344, 120, 417, 455, 93, 60, 256, 451, 188, 161, 388, 338, 238, 26, 275, 340, 109, 185};
54-
assertEquals(334, test.wiggleMaxLength(nums));
55-
}
10+
private static _376.Solution1 solution1;
11+
private static int[] nums;
12+
13+
@BeforeClass
14+
public static void setup() {
15+
solution1 = new _376.Solution1();
16+
}
17+
18+
@Test
19+
public void test1() {
20+
nums = new int[] {1, 7, 4, 9, 2, 5};
21+
assertEquals(6, solution1.wiggleMaxLength(nums));
22+
}
23+
24+
@Test
25+
public void test2() {
26+
nums = new int[] {1, 17, 5, 10, 13, 15, 10, 5, 16, 8};
27+
assertEquals(7, solution1.wiggleMaxLength(nums));
28+
}
29+
30+
@Test
31+
public void test3() {
32+
nums = new int[] {1, 2, 3, 4, 5, 6, 7, 8, 9};
33+
assertEquals(2, solution1.wiggleMaxLength(nums));
34+
}
35+
36+
@Test
37+
public void test4() {
38+
nums =
39+
new int[] {33, 53, 12, 64, 50, 41, 45, 21, 97, 35, 47, 92, 39, 0, 93, 55, 40, 46, 69, 42, 6,
40+
95, 51, 68, 72, 9, 32, 84, 34, 64, 6, 2, 26, 98, 3, 43, 30, 60, 3, 68, 82, 9, 97, 19,
41+
27, 98, 99, 4, 30, 96, 37, 9, 78, 43, 64, 4, 65, 30, 84, 90, 87, 64, 18, 50, 60, 1, 40,
42+
32, 48, 50, 76, 100, 57, 29, 63, 53, 46, 57, 93, 98, 42, 80, 82, 9, 41, 55, 69, 84, 82,
43+
79, 30, 79, 18, 97, 67, 23, 52, 38, 74, 15};
44+
assertEquals(67, solution1.wiggleMaxLength(nums));
45+
}
46+
47+
@Test
48+
public void test5() {
49+
nums = new int[] {3, 3, 3, 2, 5};
50+
assertEquals(3, solution1.wiggleMaxLength(nums));
51+
}
52+
53+
@Test
54+
public void test6() {
55+
nums =
56+
new int[] {372, 492, 288, 399, 81, 2, 320, 94, 416, 469, 427, 117, 265, 357, 399, 456, 496,
57+
337, 355, 219, 475, 295, 457, 350, 490, 470, 281, 127, 131, 36, 430, 412, 442, 174, 128,
58+
253, 1, 56, 306, 295, 340, 73, 253, 130, 259, 223, 14, 79, 409, 384, 209, 151, 317, 441,
59+
156, 275, 140, 224, 128, 250, 290, 191, 161, 472, 477, 125, 470, 230, 321, 5, 311, 23,
60+
27, 248, 138, 284, 215, 356, 320, 194, 434, 136, 221, 273, 450, 440, 28, 179, 36, 386,
61+
482, 203, 24, 8, 391, 21, 500, 484, 135, 348, 292, 396, 145, 443, 406, 61, 212, 480,
62+
455, 78, 309, 318, 84, 474, 209, 225, 177, 356, 227, 263, 181, 476, 478, 151, 494, 395,
63+
23, 114, 395, 429, 450, 247, 245, 150, 354, 230, 100, 172, 454, 155, 189, 33, 290, 187,
64+
443, 123, 59, 358, 241, 141, 39, 196, 491, 381, 157, 157, 134, 431, 295, 20, 123, 118,
65+
207, 199, 317, 188, 267, 335, 315, 308, 115, 321, 56, 52, 253, 492, 97, 374, 398, 272,
66+
74, 206, 109, 172, 471, 55, 452, 452, 329, 367, 372, 252, 99, 62, 122, 287, 320, 325,
67+
307, 481, 316, 378, 87, 97, 457, 21, 312, 249, 354, 286, 196, 43, 170, 500, 265, 253,
68+
19, 480, 438, 113, 473, 247, 257, 33, 395, 456, 246, 310, 469, 408, 112, 385, 53, 449,
69+
117, 122, 210, 286, 149, 20, 364, 372, 71, 26, 155, 292, 16, 72, 384, 160, 79, 241, 346,
70+
230, 15, 427, 96, 95, 59, 151, 325, 490, 223, 131, 81, 294, 18, 70, 171, 339, 14, 40,
71+
463, 421, 355, 123, 408, 357, 202, 235, 390, 344, 198, 98, 361, 434, 174, 216, 197, 274,
72+
231, 85, 494, 57, 136, 258, 134, 441, 477, 456, 318, 155, 138, 461, 65, 426, 162, 90,
73+
342, 284, 374, 204, 464, 9, 280, 391, 491, 231, 298, 284, 82, 417, 355, 356, 207, 367,
74+
262, 244, 283, 489, 477, 143, 495, 472, 372, 447, 322, 399, 239, 450, 168, 202, 89, 333,
75+
276, 199, 416, 490, 494, 488, 137, 327, 113, 189, 430, 320, 197, 120, 71, 262, 31, 295,
76+
218, 74, 238, 169, 489, 308, 300, 260, 397, 308, 328, 267, 419, 84, 357, 486, 289, 312,
77+
230, 64, 468, 227, 268, 28, 243, 267, 254, 153, 407, 399, 346, 385, 77, 297, 273, 484,
78+
366, 482, 491, 368, 221, 423, 107, 272, 98, 309, 426, 181, 320, 77, 185, 382, 478, 398,
79+
476, 22, 328, 450, 299, 211, 285, 62, 344, 484, 395, 466, 291, 487, 301, 407, 28, 295,
80+
36, 429, 99, 462, 240, 124, 261, 387, 30, 362, 161, 156, 184, 188, 99, 377, 392, 442,
81+
300, 98, 285, 312, 312, 365, 415, 367, 105, 81, 378, 413, 43, 326, 490, 320, 266, 390,
82+
53, 327, 75, 332, 454, 29, 370, 392, 360, 1, 335, 355, 344, 120, 417, 455, 93, 60, 256,
83+
451, 188, 161, 388, 338, 238, 26, 275, 340, 109, 185};
84+
assertEquals(334, solution1.wiggleMaxLength(nums));
85+
}
5686
}

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy