1
1
package com .thealgorithms .slidingwindow ;
2
2
3
- import org .junit .jupiter .api .Test ;
4
3
import static org .junit .jupiter .api .Assertions .assertEquals ;
5
4
5
+ import org .junit .jupiter .api .Test ;
6
+
6
7
/**
7
8
* Unit tests for the LongestSubarrayWithSumLessOrEqualToK algorithm.
8
9
*/
@@ -13,9 +14,9 @@ public class LongestSubarrayWithSumLessOrEqualToKTest {
13
14
*/
14
15
@ Test
15
16
public void testLongestSubarrayWithSumLEK () {
16
- assertEquals (3 , LongestSubarrayWithSumLessOrEqualToK .longestSubarrayWithSumLEK (new int []{1 , 2 , 3 , 4 }, 6 )); // {1, 2, 3}
17
- assertEquals (4 , LongestSubarrayWithSumLessOrEqualToK .longestSubarrayWithSumLEK (new int []{1 , 2 , 3 , 4 }, 10 )); // {1, 2, 3, 4}
18
- assertEquals (2 , LongestSubarrayWithSumLessOrEqualToK .longestSubarrayWithSumLEK (new int []{5 , 1 , 2 , 3 }, 5 )); // {5}
19
- assertEquals (0 , LongestSubarrayWithSumLessOrEqualToK .longestSubarrayWithSumLEK (new int []{1 , 2 , 3 }, 0 )); // No valid subarray
17
+ assertEquals (3 , LongestSubarrayWithSumLessOrEqualToK .longestSubarrayWithSumLEK (new int [] {1 , 2 , 3 , 4 }, 6 )); // {1, 2, 3}
18
+ assertEquals (4 , LongestSubarrayWithSumLessOrEqualToK .longestSubarrayWithSumLEK (new int [] {1 , 2 , 3 , 4 }, 10 )); // {1, 2, 3, 4}
19
+ assertEquals (2 , LongestSubarrayWithSumLessOrEqualToK .longestSubarrayWithSumLEK (new int [] {5 , 1 , 2 , 3 }, 5 )); // {5}
20
+ assertEquals (0 , LongestSubarrayWithSumLessOrEqualToK .longestSubarrayWithSumLEK (new int [] {1 , 2 , 3 }, 0 )); // No valid subarray
20
21
}
21
22
}
0 commit comments