1004_MaxConsecutiveOnesIII - a920604a/leetcode GitHub Wiki

class Solution {
public:
    int longestOnes(vector<int>& nums, int k) {
        int window=0, ret =0, l=0, r=0, n=nums.size();
        int f =k;
        while(r<n){
            int a = nums[r++];
            window+=a;
            if(a==0) f--;
            while(f<0){
                int b = nums[l++];
                if(b==0) f++;
                window-=b;
            }
            ret = max(ret, r-l);
        }
        return ret;   
    }
};