Merge pull request chipbk10#82 from chipbk10/SlidingWindow

Sliding window

Author: chipbk10

README.md

@@ -16,7 +16,7 @@
 
 # Favorite: 
 
-#### 871, 938, 174, 332, 1368
+#### 871, 938, 174, 332, 1368, 1040
 
 # FollowUp:
 

src/contest/ReadMe.java

@@ -15,7 +15,7 @@ public class ReadMe {
     // stack:               1190[!]     975[x]
     // binary search:       1351[v]     1337[v]
     // 2 pointers:          1248[*]     1234[v]
-    // sliding window:      1208[v]     1040
+    // sliding window:      1208[v]     1040[!]
     // linked-list:         1290[v]     1019[!]
     // union-find:          1202[v]     924
     // heap:                1054[!]     882

src/slidingwindow/Problem1040_MovingStonesUntilConsecutiveII.java

@@ -0,0 +1,27 @@
+package slidingwindow;
+
+import java.util.Arrays;
+
+public class Problem1040_MovingStonesUntilConsecutiveII {
+
+    public int[] numMovesStonesII(int[] A) {
+        Arrays.sort(A);
+
+        //1234___ 100 200 300
+        //1234___ 208,209,300
+        int n = A.length;
+        int leftRotation = A[n-1] - n + 2 - A[1];
+        int rightRotation = A[n-2]- A[0] - n + 2;
+        int highest = Math.max(leftRotation, rightRotation);
+
+        int missings, lowest = Integer.MAX_VALUE;
+        for (int hi = 0, lo = 0; hi < n; hi++) {
+            while (A[hi] - A[lo] >= n) lo++;
+            missings = n - (hi-lo+1);
+            if (missings == 1 && A[hi]-A[lo] == n-2) missings = 2;
+            lowest = Math.min(lowest, missings);
+        }
+
+        return new int[] {lowest, highest};
+    }
+}