@@ -18,7 +18,7 @@ void setUp() {
1818
1919 // Test for a simple sliding window case
2020 @ Test
21- void testMaxSlidingWindow_SimpleCase () {
21+ void testMaxSlidingWindowSimpleCase () {
2222 nums = new int [] {1 , 3 , -1 , -3 , 5 , 3 , 6 , 7 };
2323 k = 3 ;
2424 int [] expected = {3 , 3 , 5 , 5 , 6 , 7 };
@@ -27,7 +27,7 @@ void testMaxSlidingWindow_SimpleCase() {
2727
2828 // Test when window size is 1 (output should be the array itself)
2929 @ Test
30- void testMaxSlidingWindow_WindowSizeOne () {
30+ void testMaxSlidingWindowWindowSizeOne () {
3131 nums = new int [] {4 , 2 , 12 , 11 , -5 };
3232 k = 1 ;
3333 int [] expected = {4 , 2 , 12 , 11 , -5 };
@@ -36,7 +36,7 @@ void testMaxSlidingWindow_WindowSizeOne() {
3636
3737 // Test when the window size is equal to the array length (output should be a single max element)
3838 @ Test
39- void testMaxSlidingWindow_WindowSizeEqualsArrayLength () {
39+ void testMaxSlidingWindowWindowSizeEqualsArrayLength () {
4040 nums = new int [] {4 , 2 , 12 , 11 , -5 };
4141 k = nums .length ;
4242 int [] expected = {12 }; // Maximum of the entire array
@@ -45,7 +45,7 @@ void testMaxSlidingWindow_WindowSizeEqualsArrayLength() {
4545
4646 // Test when the input array is empty
4747 @ Test
48- void testMaxSlidingWindow_EmptyArray () {
48+ void testMaxSlidingWindowEmptyArray () {
4949 nums = new int [] {};
5050 k = 3 ;
5151 int [] expected = {};
@@ -54,7 +54,7 @@ void testMaxSlidingWindow_EmptyArray() {
5454
5555 // Test when the window size is larger than the array (should return empty)
5656 @ Test
57- void testMaxSlidingWindow_WindowSizeLargerThanArray () {
57+ void testMaxSlidingWindowWindowSizeLargerThanArray () {
5858 nums = new int [] {1 , 2 , 3 };
5959 k = 5 ;
6060 int [] expected = {}; // Window size is too large, so no result
0 commit comments