[leetcode] 1004. Max Consecutive Ones III : https://leetcode.com/problems/max-consecutive-ones-iii/

Max Consecutive Ones III.cpp

class Solution {
public:
    int longestOnes(vector<int>& A, int K) {
        int answer = 0;
        queue<int> zeroQ;
        int start = 0;
        for(int end=0;end<A.size();end++){
            if(A[end] == 0)
                zeroQ.push(end);
            if(!zeroQ.empty() && zeroQ.size() > K){
                start = zeroQ.front()+1; zeroQ.pop();
            }
            
            answer = max(answer, end - start + 1);
        }
        return answer;
    }
};