Add solution #1004

Author: JoshCrozier

README.md

@@ -270,6 +270,7 @@
 994|[Rotting Oranges](./0994-rotting-oranges.js)|Medium|
 997|[Find the Town Judge](./0997-find-the-town-judge.js)|Easy|
 1002|[Find Common Characters](./1002-find-common-characters.js)|Easy|
+1004|[Max Consecutive Ones III](./1004-max-consecutive-ones-iii.js)|Medium|
 1009|[Complement of Base 10 Integer](./1009-complement-of-base-10-integer.js)|Easy|
 1010|[Pairs of Songs With Total Durations Divisible by 60](./1010-pairs-of-songs-with-total-durations-divisible-by-60.js)|Medium|
 1022|[Sum of Root To Leaf Binary Numbers](./1022-sum-of-root-to-leaf-binary-numbers.js)|Easy|

solutions/1004-max-consecutive-ones-iii.js

@@ -0,0 +1,29 @@
+/**
+ * 1004. Max Consecutive Ones III
+ * https://leetcode.com/problems/max-consecutive-ones-iii/
+ * Difficulty: Medium
+ *
+ * Given a binary array nums and an integer k, return the maximum number of consecutive 1's
+ * in the array if you can flip at most k 0's.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var longestOnes = function(nums, k) {
+  let left = 0;
+  let right = 0;
+
+  while (right < nums.length) {
+    if (!nums[right]) k--;
+    if (k < 0) {
+      if (!nums[left]) k++;
+      left++;
+    }
+    right++;
+  }
+
+  return right - left;
+};