11package com .thealgorithms .slidingwindow ;
22
3- import org .junit .jupiter .api .Test ;
43import static org .junit .jupiter .api .Assertions .assertEquals ;
54
5+ import org .junit .jupiter .api .Test ;
6+
67/**
78 * Unit tests for the LongestSubarrayWithSumLessOrEqualToK algorithm.
89 */
@@ -13,9 +14,9 @@ public class LongestSubarrayWithSumLessOrEqualToKTest {
1314 */
1415 @ Test
1516 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
2021 }
2122}
0 commit comments