mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-12-19 07:00:35 +08:00
Add Longest Subarray With Sum Less Than or Equal to K algorithm (#6042)
This commit is contained in:
@@ -0,0 +1,22 @@
|
||||
package com.thealgorithms.slidingwindow;
|
||||
|
||||
import static org.junit.jupiter.api.Assertions.assertEquals;
|
||||
|
||||
import org.junit.jupiter.api.Test;
|
||||
|
||||
/**
|
||||
* Unit tests for the LongestSubarrayWithSumLessOrEqualToK algorithm.
|
||||
*/
|
||||
public class LongestSubarrayWithSumLessOrEqualToKTest {
|
||||
|
||||
/**
|
||||
* Tests for the longest subarray with a sum less than or equal to k.
|
||||
*/
|
||||
@Test
|
||||
public void testLongestSubarrayWithSumLEK() {
|
||||
assertEquals(3, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {1, 2, 3, 4}, 6)); // {1, 2, 3}
|
||||
assertEquals(4, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {1, 2, 3, 4}, 10)); // {1, 2, 3, 4}
|
||||
assertEquals(2, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {5, 1, 2, 3}, 5)); // {5}
|
||||
assertEquals(0, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {1, 2, 3}, 0)); // No valid subarray
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user