Skip to content

Commit 594fadc

Browse files
committed
added another testcase
1 parent 0560080 commit 594fadc

File tree

1 file changed

+12
-6
lines changed

1 file changed

+12
-6
lines changed
Lines changed: 12 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1,15 +1,21 @@
11
package com.thealgorithms.slidingwindow;
22

3-
import static org.junit.jupiter.api.Assertions.assertEquals;
4-
53
import org.junit.jupiter.api.Test;
4+
import static org.junit.jupiter.api.Assertions.assertEquals;
65

6+
/**
7+
* Unit tests for the LongestSubarrayWithSumLessOrEqualToK algorithm.
8+
*/
79
public class LongestSubarrayWithSumLessOrEqualToKTest {
10+
11+
/**
12+
* Tests for the longest subarray with a sum less than or equal to k.
13+
*/
814
@Test
915
public void testLongestSubarrayWithSumLEK() {
10-
assertEquals(3, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {1, 2, 3, 4}, 6)); // {1, 2, 3}
11-
assertEquals(4, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {1, 2, 3, 4}, 10)); // {1, 2, 3, 4}
12-
assertEquals(2, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {5, 1, 2, 3}, 5)); // {5}
13-
assertEquals(0, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {1, 2, 3}, 0)); // No valid subarray
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
1420
}
1521
}

0 commit comments

Comments
 (0)