solutioin: 1004. Max Consecutive Ones III

Author: flynnpark

solutions/solution_1004/__init__.py

@@ -3,4 +3,14 @@
 
 class Solution:
     def longestOnes(self, nums: List[int], k: int) -> int:
-        ...
+        left = 0
+        right = 0
+        while right < len(nums):
+            if nums[right] == 0:
+                k -= 1
+            if k < 0:
+                if nums[left] == 0:
+                    k += 1
+                left += 1
+            right += 1
+        return right - left