From 88c8ee8414b489f895ee800932873a777c36746d Mon Sep 17 00:00:00 2001
From: akanksha0820 <akankshagutal@gmail.com>
Date: Sat, 17 Oct 2020 00:14:29 +0530
Subject: [PATCH] Sliding Window in java

Created a Sliding window program in Java.
---
 JAVA/SlidingWindow.java | 33 +++++++++++++++++++++++++++++++++
 1 file changed, 33 insertions(+)
 create mode 100644 JAVA/SlidingWindow.java

diff --git a/JAVA/SlidingWindow.java b/JAVA/SlidingWindow.java
new file mode 100644
index 0000000..087ca1a
--- /dev/null
+++ b/JAVA/SlidingWindow.java
@@ -0,0 +1,33 @@
+// 239. Sliding Window Maximum
+// https://leetcode.com/problems/sliding-window-maximum/
+
+import java.util.*; 
+class Solution {
+    public int[] maxSlidingWindow(int[] a, int k) {
+        int n = a.length;
+        Deque<Integer> dq = new LinkedList<>();
+        int ans[] = new int[n-k+1];
+        int i = 0;
+        for(;i<k;i++){
+            while(!dq.isEmpty() && a[dq.peekLast()] <= a[i]){
+                dq.removeLast();
+            }
+            dq.addLast(i);
+        }
+        
+        for(;i<n ; i++)
+        {
+            ans[i-k] = a[dq.peekFirst()];
+            while(!dq.isEmpty() && dq.peekFirst() <= i-k){
+                dq.removeFirst();
+            }
+            while(!dq.isEmpty() && a[dq.peekLast()] <= a[i]){
+                dq.removeLast();
+            }
+            dq.addLast(i);
+        }
+        ans[i-k] = a[dq.peekFirst()];
+        
+        return ans; 
+        }
+}
\ No newline at end of file