2022-03-27 18:35:17 +08:00
< p > Given a binary array < code > nums< / code > and an integer < code > k< / code > , return < em > the maximum number of consecutive < / em > < code > 1< / code > < em > ' s in the array if you can flip at most< / em > < code > k< / code > < code > 0< / code > ' s.< / p >
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 1:< / strong > < / p >
2022-03-27 18:35:17 +08:00
< pre >
< strong > Input:< / strong > nums = [1,1,1,0,0,0,1,1,1,1,0], k = 2
< strong > Output:< / strong > 6
< strong > Explanation:< / strong > [1,1,1,0,0,< u > < strong > 1< / strong > ,1,1,1,1,< strong > 1< / strong > < / u > ]
Bolded numbers were flipped from 0 to 1. The longest subarray is underlined.< / pre >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 2:< / strong > < / p >
2022-03-27 18:35:17 +08:00
< pre >
< strong > Input:< / strong > nums = [0,0,1,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1], k = 3
< strong > Output:< / strong > 10
< strong > Explanation:< / strong > [0,0,< u > 1,1,< strong > 1< / strong > ,< strong > 1< / strong > ,1,1,1,< strong > 1< / strong > ,1,1< / u > ,0,0,0,1,1,1,1]
Bolded numbers were flipped from 0 to 1. The longest subarray is underlined.
< / pre >
< p > < / p >
< p > < strong > Constraints:< / strong > < / p >
< ul >
< li > < code > 1 < = nums.length < = 10< sup > 5< / sup > < / code > < / li >
< li > < code > nums[i]< / code > is either < code > 0< / code > or < code > 1< / code > .< / li >
< li > < code > 0 < = k < = nums.length< / code > < / li >
< / ul >
