forked from TheAlgorithms/Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCountNiceSubarraysTest.java
More file actions
55 lines (45 loc) · 1.43 KB
/
CountNiceSubarraysTest.java
File metadata and controls
55 lines (45 loc) · 1.43 KB
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 com.thealgorithms.slidingwindow;
import static org.junit.jupiter.api.Assertions.assertEquals;
import org.junit.jupiter.api.Test;
public class CountNiceSubarraysTest {
@Test
void testExampleCase() {
int[] nums = {1, 1, 2, 1, 1};
assertEquals(2, CountNiceSubarrays.countNiceSubarrays(nums, 3));
}
@Test
void testAllEvenNumbers() {
int[] nums = {2, 4, 6, 8};
assertEquals(0, CountNiceSubarrays.countNiceSubarrays(nums, 1));
}
@Test
void testSingleOdd() {
int[] nums = {1};
assertEquals(1, CountNiceSubarrays.countNiceSubarrays(nums, 1));
}
@Test
void testMultipleChoices() {
int[] nums = {2, 2, 1, 2, 2, 1, 2};
assertEquals(6, CountNiceSubarrays.countNiceSubarrays(nums, 2));
}
@Test
void testTrailingEvenNumbers() {
int[] nums = {1, 2, 2, 2};
assertEquals(4, CountNiceSubarrays.countNiceSubarrays(nums, 1));
}
@Test
void testMultipleWindowShrinks() {
int[] nums = {1, 1, 1, 1};
assertEquals(3, CountNiceSubarrays.countNiceSubarrays(nums, 2));
}
@Test
void testEvensBetweenOdds() {
int[] nums = {2, 1, 2, 1, 2};
assertEquals(4, CountNiceSubarrays.countNiceSubarrays(nums, 2));
}
@Test
void testShrinkWithTrailingEvens() {
int[] nums = {2, 2, 1, 2, 2, 1, 2, 2};
assertEquals(9, CountNiceSubarrays.countNiceSubarrays(nums, 2));
}
}