Max Consecutive Ones III
Given a binary array nums and an integer k, return the maximum number of consecutive 1's in the array if you can flip at most k 0's.
Example 1
Input
nums = [1,1,1,0,0,0,1,1,1,1,0], k = 2Output
6Flipping two zeros to ones produces a longest consecutive run of 6 ones.
Example 2
Input
nums = [0,0,1,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1], k = 3Output
10Flipping three zeros to ones produces a longest consecutive run of 10 ones.
Constraints
- 1 <= nums.length <= 10^5
- nums[i] is either 0 or 1.
- 0 <= k <= nums.length