滑动窗口实际上是双指针的一类变形 。
class Solution {
public int longestOnes(int[] A, int K) {
int left = 0;
int right = 0;
int len = A.length;
int count = 0;
int result = 0;
while(right < len){
if(A[right] == 0){
count++;
}
while(count > K){//窗口的收缩
result = Math.max(result, right - left);
if(A[left] == 0){
count--;
}
left++;
}
right++;
}
return Math.max(result, right - left);
}
}