update deque.pollLast

zgpeace · zgpeace · commit b63fbf834b88 · 2019-03-10T17:17:46.000+08:00
diff --git a/code/LeetCode/src/popular/SlidingWindowMaximum.java b/code/LeetCode/src/popular/SlidingWindowMaximum.java
@@ -45,7 +45,7 @@ public int[] maxSlidingWindowWithDeque(int[] nums, int k) {
             }
             // remove smaller numbers in k range as they are useless
             while (!deque.isEmpty() && nums[deque.peekLast()] < nums[i]) {
-                deque.poll();
+                deque.pollLast();
             }
             // deque contains index... r contains content
             deque.offer(i);
@@ -59,7 +59,8 @@ public int[] maxSlidingWindowWithDeque(int[] nums, int k) {
     }
 
     public static void main(String[] args) {
-        int[] nums = {1,3,-1,-3,5,3,6,7};
+        //int[] nums = {1,3,-1,-3,5,3,6,7};
+        int[] nums = {1,3,1,2,0,5};
         int k = 3;
         SlidingWindowMaximum obj = new SlidingWindowMaximum();
         //int[] windowMax = obj.maxSlidingWindow(nums, k);

Original file line number	Diff line number	Diff line change
`@@ -45,7 +45,7 @@ public int[] maxSlidingWindowWithDeque(int[] nums, int k) {`
`45`	`45`	`}`
`46`	`46`	`// remove smaller numbers in k range as they are useless`
`47`	`47`	`while (!deque.isEmpty() && nums[deque.peekLast()] < nums[i]) {`
`48`		`- deque.poll();`
	`48`	`+ deque.pollLast();`
`49`	`49`	`}`
`50`	`50`	`// deque contains index... r contains content`
`51`	`51`	`deque.offer(i);`
`@@ -59,7 +59,8 @@ public int[] maxSlidingWindowWithDeque(int[] nums, int k) {`
`59`	`59`	`}`
`60`	`60`
`61`	`61`	`public static void main(String[] args) {`
`62`		`- int[] nums = {1,3,-1,-3,5,3,6,7};`
	`62`	`+ //int[] nums = {1,3,-1,-3,5,3,6,7};`
	`63`	`+ int[] nums = {1,3,1,2,0,5};`
`63`	`64`	`int k = 3;`
`64`	`65`	`SlidingWindowMaximum obj = new SlidingWindowMaximum();`
`65`	`66`	`//int[] windowMax = obj.maxSlidingWindow(nums, k);`