Given an array A
of 0s and 1s, we may change up to K
values from 0 to 1.
Return the length of the longest (contiguous) subarray that contains only 1s.
Example 1:
Input: A = [1,1,1,0,0,0,1,1,1,1,0], K = 2
Output: 6
Explanation:
[1,1,1,0,0,1,1,1,1,1,1]
Bolded numbers were flipped from 0 to 1. The longest subarray is underlined.
Example 2:
Input: A = [0,0,1,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1], K = 3
Output: 10
Explanation:
[0,0,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,1,1]
Bolded numbers were flipped from 0 to 1. The longest subarray is underlined.
Note:
1 <= A.length <= 20000
0 <= K <= A.length
A[i]
is0
or1
思路:典型的同向双指针题目,count最长的区间使得最多含有K个0; 注意等于K的时候,如果还是1,还是可以继续走的;所以是<=K, Time: O(N)
class Solution {
public int longestOnes(int[] nums, int k) {
int res = 0;
int j = 0;
int C = 0;
for(int i = 0; i < nums.length; i++) {
// move j;
while(j < nums.length && C <= k) {
if(nums[j] == 0) {
if(C == k) {
break;
}
C++;
}
j++;
}
// update res;
res = Math.max(res, j - i);
// move i;
if(nums[i] == 0) {
C--;
}
}
return res;
}
}