Time: 945 ms (33.14%), Space: 14.7 MB (50.48%) - LeetHub

r-rahul1 · Feb 23, 2022 · e6d3fd3 · e6d3fd3
1 parent 659f6a1
commit e6d3fd3
Showing 1 changed file with 15 additions and 0 deletions.
diff --git a/1004-max-consecutive-ones-iii/1004-max-consecutive-ones-iii.py b/1004-max-consecutive-ones-iii/1004-max-consecutive-ones-iii.py
@@ -0,0 +1,15 @@
+class Solution:
+    def longestOnes(self, nums: List[int], k: int) -> int:
+
+        maxr = wstart = ml = 0
+
+        for wend in range(len(nums)):
+            if nums[wend] == 0:
+                maxr += 1
+            if maxr >k:
+                if nums[wstart] ==0:
+                    maxr -= 1
+                wstart += 1
+            ml = max(ml,wend-wstart+1)
+        return ml
+