fd

Author: dingjikerbo

facebook/src/main/java/com/leetcode/facebook/FlattenNestedListIterator.java

@@ -1,6 +1,6 @@
 package com.leetcode.facebook;
 
-import com.inuker.solution.NestedInteger;
+import com.leetcode.library.NestedInteger;
 
 import java.util.Iterator;
 import java.util.List;

solution/src/main/java/com/inuker/solution/NestedInteger.java renamed to library/src/main/java/com/leetcode/library/NestedInteger.java

@@ -1,4 +1,4 @@
-package com.inuker.solution;
+package com.leetcode.library;
 
 import java.util.List;
 

solution/src/main/java/com/inuker/solution/NestedIterator.java renamed to solution/src/main/java/com/inuker/solution/FlattenNestedListIterator.java

@@ -1,5 +1,7 @@
 package com.inuker.solution;
 
+import com.leetcode.library.NestedInteger;
+
 import java.util.Iterator;
 import java.util.List;
 import java.util.Stack;
@@ -8,11 +10,11 @@
  * Created by dingjikerbo on 2016/11/22.
  */
 
-public abstract class NestedIterator implements Iterator<Integer> {
+public abstract class FlattenNestedListIterator implements Iterator<Integer> {
 
     private Stack<NestedInteger> stack;
 
-    public NestedIterator(List<NestedInteger> nestedList) {
+    public FlattenNestedListIterator(List<NestedInteger> nestedList) {
         stack = new Stack<NestedInteger>();
         push(nestedList);
     }

solution/src/main/java/com/inuker/solution/SlidingWindowMaximum.java

@@ -51,7 +51,7 @@ public int[] maxSlidingWindow2(int[] nums, int k) {
                 queue.pollLast();
             }
             queue.offerLast(i);
-            if (queue.peekFirst() + k <= i) {
+            if (queue.peekFirst() <= i - k) {
                 queue.pollFirst();
             }
             if (i - k + 1 >= 0) {