难度:中等
给定一个二进制数组
nums
和一个整数k
,如果可以翻转最多k
个0
,则返回 数组中连续1
的最大个数 。示例 1:
输入:nums = [1,1,1,0,0,0,1,1,1,1,0], K = 2 输出:6 解释:[1,1,1,0,0,1,1,1,1,1,1] 粗体数字从 0 翻转到 1,最长的子数组长度为 6。示例 2:
输入:nums = [0,0,1,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1], K = 3 输出:10 解释:[0,0,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,1,1] 粗体数字从 0 翻转到 1,最长的子数组长度为 10。提示:
1 <= nums.length <=
nums[i]
不是0
就是1
0 <= k <= nums.length
代码:
class Solution {
public int longestOnes(int[] nums, int k) {
int longest = 0;
for (int left = 0, right = 0, changed = 0; right < nums.length; right++) {
changed += nums[right] != 1 ? 1 : 0;
while (changed > k) {
changed -= nums[left++] != 1 ? 1 : 0;
}
longest = Math.max(longest, right - left + 1);
}
return longest;
}
}