Time: 30 ms (71.88%), Space: 147.6 MB (42.54%) - LeetHub

Author: devxoshakya

0239-sliding-window-maximum/0239-sliding-window-maximum.java

@@ -0,0 +1,24 @@
+class Solution {
+    public int[] maxSlidingWindow(int[] nums, int k) {
+        int n = nums.length;
+        if (n == 0 || k == 0) {
+            return new int[0];
+        }
+        int[] result = new int[n - k + 1];
+        Deque<Integer> win = new ArrayDeque<>();
+
+        for (int i = 0; i < n; ++i) {
+            while (win.size() > 0 && win.peekFirst() <= i - k) {
+                win.pollFirst();
+            }
+            while (win.size() > 0 && nums[win.peekLast()] < nums[i]) {
+                win.pollLast();
+            }
+            win.offerLast(i);
+            if (i >= k - 1) {
+                result[i - k + 1] = nums[win.peekFirst()];
+            }
+        }
+        return result;
+    }
+}