Given a binary array nums and an integer k, return the maximum number of consecutive 111's in nums if you are allowed to flip at most k zeros to ones.
nums
k
Constraints:
1≤1 \leq1≤ nums.length ≤105\leq 10^5≤105
nums.length
nums[i] is either 000 or 111
nums[i]
0≤0 \leq0≤ k ≤\leq≤ ...