Add Maximum Sliding Window algorithm (#5848)

This commit is contained in:
pranayh24
2024-10-27 00:35:14 +05:30
committed by GitHub
parent 3da16a7fe0
commit 985c1f9dd1
2 changed files with 119 additions and 0 deletions

View File

@@ -0,0 +1,63 @@
package com.thealgorithms.others;
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
import org.junit.jupiter.api.BeforeEach;
import org.junit.jupiter.api.Test;
class MaximumSlidingWindowTest {
MaximumSlidingWindow msw;
int[] nums;
int k;
@BeforeEach
void setUp() {
msw = new MaximumSlidingWindow(); // Initialize the MaximumSlidingWindow object
}
// Test for a simple sliding window case
@Test
void testMaxSlidingWindowSimpleCase() {
nums = new int[] {1, 3, -1, -3, 5, 3, 6, 7};
k = 3;
int[] expected = {3, 3, 5, 5, 6, 7};
assertArrayEquals(expected, msw.maxSlidingWindow(nums, k));
}
// Test when window size is 1 (output should be the array itself)
@Test
void testMaxSlidingWindowWindowSizeOne() {
nums = new int[] {4, 2, 12, 11, -5};
k = 1;
int[] expected = {4, 2, 12, 11, -5};
assertArrayEquals(expected, msw.maxSlidingWindow(nums, k));
}
// Test when the window size is equal to the array length (output should be a single max element)
@Test
void testMaxSlidingWindowWindowSizeEqualsArrayLength() {
nums = new int[] {4, 2, 12, 11, -5};
k = nums.length;
int[] expected = {12}; // Maximum of the entire array
assertArrayEquals(expected, msw.maxSlidingWindow(nums, k));
}
// Test when the input array is empty
@Test
void testMaxSlidingWindowEmptyArray() {
nums = new int[] {};
k = 3;
int[] expected = {};
assertArrayEquals(expected, msw.maxSlidingWindow(nums, k));
}
// Test when the window size is larger than the array (should return empty)
@Test
void testMaxSlidingWindowWindowSizeLargerThanArray() {
nums = new int[] {1, 2, 3};
k = 5;
int[] expected = {}; // Window size is too large, so no result
assertArrayEquals(expected, msw.maxSlidingWindow(nums, k));
}
}