fix 487

fishercoder1534 · fishercoder1534 · commit 623c4310fa9a · 2021-10-21T11:40:30.000-07:00
diff --git a/README.md b/README.md
@@ -787,7 +787,7 @@ _If you like this project, please leave me a star._ &#9733;
 |491|[Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_491.java) | |Medium| Backtracking, DFS
 |490|[The Maze](https://leetcode.com/problems/the-maze/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_490.java) |  |Medium| BFS
 |488|[Zuma Game](https://leetcode.com/problems/zuma-game/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_488.java) |  |Hard | DFS, Backtracking
-|487|[Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_487.java) | [:tv:](https://youtu.be/nKhteIRZ2Ok) |Medium| Array
+|487|[Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_487.java) | [:tv:](https://youtu.be/nKhteIRZ2Ok) |Medium| Array, Sliding Window
 |486|[Predict the Winner](https://leetcode.com/problems/predict-the-winner/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_486.java) | | Medium | DP
 |485|[Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/)|[Java](../master/src/main/java/com/fishercoder/solutions/_485.java) [Javascript](../master/javascript/_485.js)| [:tv:](https://youtu.be/nKhteIRZ2Ok)|Easy| Array
 |484|[Find Permutation](https://leetcode.com/problems/find-permutation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_484.java) |  |Medium | Array, String, Greedy
diff --git a/src/main/java/com/fishercoder/solutions/_487.java b/src/main/java/com/fishercoder/solutions/_487.java
@@ -2,17 +2,32 @@
 
 public class _487 {
 
-    public static int findMaxConsecutiveOnes(int[] nums) {
-        int maxOnes = 0;
-        for (int i = 0; i < nums.length; i++) {
-            int newOnes = 0;
-            while (i < nums.length && nums[i] == 1) {
-                newOnes++;
-                i++;
+    public static class Solution1 {
+        /**
+         * I implemented this on my own after a quick read from https://leetcode.com/problems/max-consecutive-ones-ii/solution/
+         */
+        public static int findMaxConsecutiveOnes(int[] nums) {
+            int left = 0;
+            int right = 0;
+            int zeroes = 0;
+            int ans = 0;
+            while (right < nums.length) {
+                if (nums[right] == 0) {
+                    zeroes++;
+                }
+                if (zeroes <= 1) {
+                    ans = Math.max(ans, right - left + 1);
+                } else {
+                    while (left < nums.length && zeroes > 1) {
+                        if (nums[left] == 0) {
+                            zeroes--;
+                        }
+                        left++;
+                    }
+                }
+                right++;
             }
-            maxOnes = Math.max(maxOnes, newOnes);
+            return ans;
         }
-        return maxOnes;
     }
-
 }
diff --git a/src/test/java/com/fishercoder/_487Test.java b/src/test/java/com/fishercoder/_487Test.java
