refactor 239

fishercoder1534 · fishercoder1534 · commit f5c89a01b836 · 2018-10-13T08:11:57.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_239.java b/src/main/java/com/fishercoder/solutions/_239.java
@@ -35,24 +35,26 @@ 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];
-        }
-        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();
+    public static class Solution1 {
+        public int[] maxSlidingWindow(int[] nums, int k) {
+            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();
                 }
-            } else {
-                heap.remove(nums[i - k]);
-                heap.offer(nums[i]);
-                res[i - k + 1] = heap.peek();
             }
+            return res;
         }
-        return res;
     }
 }
diff --git a/src/test/java/com/fishercoder/_239Test.java b/src/test/java/com/fishercoder/_239Test.java
@@ -6,19 +6,16 @@
 import org.junit.BeforeClass;
 import org.junit.Test;
 
-/**
- * Created by fishercoder on 1/10/17.
- */
 public class _239Test {
-    private static _239 test;
+    private static _239.Solution1 solution1;
     private static int[] expected;
     private static int[] actual;
     private static int[] nums;
     private static int k;
 
     @BeforeClass
     public static void setup() {
-        test = new _239();
+        solution1 = new _239.Solution1();
     }
 
     @Before
@@ -35,7 +32,7 @@ public void test1() {
         nums = new int[]{1, 3, -1, -3, 5, 3, 6, 7};
         k = 3;
         expected = new int[]{3, 3, 5, 5, 6, 7};
-        actual = test.maxSlidingWindow(nums, k);
+        actual = solution1.maxSlidingWindow(nums, k);
         Assert.assertArrayEquals(expected, actual);
 
     }
