LeetCode:1004. 最大连续1的个数 III
map 数组记录
滑动窗口 --> 双指针
AC Code
class Solution {
public int longestOnes(int[] a, int k) {
int[] map = new int[2];
int left = 0, right = 0, len = a.length;
while(right < len) {
map[a[right]]++;
int dis = right - left + 1;
if(dis - map[1] > k) {
//
map[a[left]]--;
left++;
}
right++;
}
return right - left;
}
}