Max Consecutive Ones III.py

// Runtime: 398 ms (Top 99.0%) | Memory: 17.90 MB (Top 17.54%)

class Solution:
    def longestOnes(self, nums: List[int], k: int) -> int:
        l=r=0    
        for r in range(len(nums)):
            if nums[r] == 0:
                k-=1
            if k<0:
                if nums[l] == 0:
                    k+=1
                l+=1
        return r-l+1