Add solution #487

Author: JoshCrozier

README.md

@@ -475,6 +475,7 @@
 484|[Find Permutation](./solutions/0484-find-permutation.js)|Medium|
 485|[Max Consecutive Ones](./solutions/0485-max-consecutive-ones.js)|Easy|
 486|[Predict the Winner](./solutions/0486-predict-the-winner.js)|Medium|
+487|[Max Consecutive Ones II](./solutions/0487-max-consecutive-ones-ii.js)|Medium|
 488|[Zuma Game](./solutions/0488-zuma-game.js)|Hard|
 491|[Non-decreasing Subsequences](./solutions/0491-non-decreasing-subsequences.js)|Medium|
 492|[Construct the Rectangle](./solutions/0492-construct-the-rectangle.js)|Easy|

solutions/0487-max-consecutive-ones-ii.js

@@ -0,0 +1,38 @@
+/**
+ * 487. Max Consecutive Ones II
+ * https://leetcode.com/problems/max-consecutive-ones-ii/
+ * Difficulty: Medium
+ *
+ * Given a binary array nums, return the maximum number of consecutive 1's in the array
+ * if you can flip at most one 0.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findMaxConsecutiveOnes = function(nums) {
+  let result = 0;
+  let currentConsecutive = 0;
+  let zeroCount = 0;
+  let left = 0;
+
+  for (let right = 0; right < nums.length; right++) {
+    if (nums[right] === 0) {
+      zeroCount++;
+    }
+
+    while (zeroCount > 1) {
+      if (nums[left] === 0) {
+        zeroCount--;
+      }
+      currentConsecutive--;
+      left++;
+    }
+
+    currentConsecutive++;
+    result = Math.max(result, currentConsecutive);
+  }
+
+  return result;
+};