seshireddy
diff --git a/‎src/main/java/com/fishercoder/solutions/_239.java
Lines changed: 16 additions & 25 deletions b/‎src/main/java/com/fishercoder/solutions/_239.java
Lines changed: 16 additions & 25 deletions
diff --git a/‎src/test/java/com/fishercoder/_239Test.java
Lines changed: 3 additions & 3 deletions b/‎src/test/java/com/fishercoder/_239Test.java
Lines changed: 3 additions & 3 deletions
@@ -3,6 +3,8 @@
 import java.util.*;
 
 /**
+ * 239. Sliding Window Maximum
+ *
  * Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right.
  * You can only see the k numbers in the window. Each time the sliding window moves right by one position.
 
@@ -11,7 +13,7 @@
 
  Window position                Max
  ---------------               -----
- [1  3  -1] -3  5  3  6  7       3
+ [1  3  -1] -3  5  3  6  7      3
  1 [3  -1  -3] 5  3  6  7       3
  1  3 [-1  -3  5] 3  6  7       5
  1  3  -1 [-3  5  3] 6  7       5
@@ -34,32 +36,21 @@ How about using a data structure such as deque (double-ended queue)?
 public class _239 {
 
     public int[] maxSlidingWindow(int[] nums, int k) {
-        if(nums == null || nums.length == 0 || k == 0) return new int[0];
-        Queue<Integer> heap = new PriorityQueue<Integer>(new Comparator<Integer>(){
-            @Override
-            public int compare(Integer o1, Integer o2) {
-                if(o1 > o2) return -1;
-                else if(o1 < o2) return 1;
-                else return 0;
+        if (nums == null || nums.length == 0 || k == 0) return new int[0];
+        PriorityQueue<Integer> heap = new PriorityQueue<>((a, b) -> b - a);
+        int[] res = new int[nums.length - k + 1];
+        for (int i = 0; i < nums.length; i++) {
+            if (i < k) {
+                heap.offer(nums[i]);
+                if (i == k - 1) {
+                    res[0] = heap.peek();
+                }
+            } else {
+                heap.remove(nums[i - k]);
+                heap.offer(nums[i]);
+                res[i - k + 1] = heap.peek();
             }
         }
-        );
-        int i = 0;
-        for(; i < k; i++){
-            heap.offer(nums[i]);
-        }
-        List<Integer> list = new ArrayList<Integer>();
-        list.add(heap.peek());
-        for(; i < nums.length; i++){
-            heap.remove(nums[i-k]);
-            heap.offer(nums[i]);
-            list.add(heap.peek());
-        }
-        int[] res = new int[list.size()];
-        for(int j = 0; j < list.size(); j++){
-            res[j] = list.get(j);
-        }
         return res;
     }
-
 }
@@ -23,9 +23,9 @@ public static void setup(){
 
     @Before
     public void setupForEachTest(){
-        expected = new int[1000];
-        actual = new int[1000];
-        nums = new int[1000];
+        expected = new int[]{};
+        actual = new int[]{};
+        nums = new int[]{};
         k = 0;
     }