Max Consecutive Ones III LeetCode solution in C++

1
class Solution {
2
 public:
3
  int longestOnes(vector<int> &A, int K) {
4
    int start = 0, max = INT_MIN, zeroCounter = 0;
5
    for (int end = 0; end < A.size(); end++) {
6
      if (A[end] == 0) {
7
        zeroCounter++;
8
      }
9
      while (zeroCounter > K) {
10
        if (A[start] == 0) {
11
          zeroCounter--;
12
        }
13
        start++;
14
      }
15

16
      max = std::max(max, end - start + 1);
17
    }
18

19
    return max;
20
  }
21
};