edit 239

Author: fishercoder1534

README.md

@@ -306,7 +306,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |242|[Valid Anagram](https://leetcode.com/problems/valid-anagram/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_242.java) | O(n) | O(1) | Easy
 |241|[Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_241.java) | O(O(n * 4^n / n^(3/2))) | O(n * 4^n / n^(3/2)) | Medium | Divide and Conquer
 |240|[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/Searcha2DMatrixII.java)| O(log(m*n))|O(1) | Medium| Binary Search
-|239|[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/SlidingWindowMaximum.java)| O(nlogn)|O(k) | Hard| Heap
+|239|[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_239.java)| O(nlogn)|O(k) | Hard| Heap
 |238|[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_238.java)| O(n)|O(1) | Medium| Array
 |237|[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_237.java)| O(1)|O(1) | Easy| LinkedList
 |236|[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_236.java)| O(n)|O(h) | Medium| DFS

src/main/java/com/fishercoder/solutions/SlidingWindowMaximum.java src/main/java/com/fishercoder/solutions/_239.java

@@ -3,7 +3,8 @@
 import java.util.*;
 
 /**
- * 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.
+ * 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.
 
  For example,
  Given nums = [1,3,-1,-3,5,3,6,7], and k = 3.
@@ -30,19 +31,17 @@ How about using a data structure such as deque (double-ended queue)?
  The queue size need not be the same as the window’s size.
  Remove redundant elements and the queue should store only elements that need to be considered.
  */
-public class SlidingWindowMaximum {
+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;
             }
-
         }
         );
         int i = 0;

src/test/java/com/fishercoder/SlidingWindowMaximumTest.java src/test/java/com/fishercoder/_239Test.java

@@ -1,6 +1,6 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions.SlidingWindowMaximum;
+import com.fishercoder.solutions._239;
 import org.junit.Assert;
 import org.junit.Before;
 import org.junit.BeforeClass;
@@ -9,16 +9,16 @@
 /**
  * Created by fishercoder on 1/10/17.
  */
-public class SlidingWindowMaximumTest {
-    private static SlidingWindowMaximum test;
+public class _239Test {
+    private static _239 test;
     private static int[] expected;
     private static int[] actual;
     private static int[] nums;
     private static int k;
 
     @BeforeClass
     public static void setup(){
-        test = new SlidingWindowMaximum();
+        test = new _239();
     }
 
     @Before