@@ -18,7 +18,7 @@ void setUp() {
18
18
19
19
// Test for a simple sliding window case
20
20
@ Test
21
- void testMaxSlidingWindow_SimpleCase () {
21
+ void testMaxSlidingWindowSimpleCase () {
22
22
nums = new int [] {1 , 3 , -1 , -3 , 5 , 3 , 6 , 7 };
23
23
k = 3 ;
24
24
int [] expected = {3 , 3 , 5 , 5 , 6 , 7 };
@@ -27,7 +27,7 @@ void testMaxSlidingWindow_SimpleCase() {
27
27
28
28
// Test when window size is 1 (output should be the array itself)
29
29
@ Test
30
- void testMaxSlidingWindow_WindowSizeOne () {
30
+ void testMaxSlidingWindowWindowSizeOne () {
31
31
nums = new int [] {4 , 2 , 12 , 11 , -5 };
32
32
k = 1 ;
33
33
int [] expected = {4 , 2 , 12 , 11 , -5 };
@@ -36,7 +36,7 @@ void testMaxSlidingWindow_WindowSizeOne() {
36
36
37
37
// Test when the window size is equal to the array length (output should be a single max element)
38
38
@ Test
39
- void testMaxSlidingWindow_WindowSizeEqualsArrayLength () {
39
+ void testMaxSlidingWindowWindowSizeEqualsArrayLength () {
40
40
nums = new int [] {4 , 2 , 12 , 11 , -5 };
41
41
k = nums .length ;
42
42
int [] expected = {12 }; // Maximum of the entire array
@@ -45,7 +45,7 @@ void testMaxSlidingWindow_WindowSizeEqualsArrayLength() {
45
45
46
46
// Test when the input array is empty
47
47
@ Test
48
- void testMaxSlidingWindow_EmptyArray () {
48
+ void testMaxSlidingWindowEmptyArray () {
49
49
nums = new int [] {};
50
50
k = 3 ;
51
51
int [] expected = {};
@@ -54,7 +54,7 @@ void testMaxSlidingWindow_EmptyArray() {
54
54
55
55
// Test when the window size is larger than the array (should return empty)
56
56
@ Test
57
- void testMaxSlidingWindow_WindowSizeLargerThanArray () {
57
+ void testMaxSlidingWindowWindowSizeLargerThanArray () {
58
58
nums = new int [] {1 , 2 , 3 };
59
59
k = 5 ;
60
60
int [] expected = {}; // Window size is too large, so no result
0 commit comments