Given a binary array nums and an integer k, return the maximum number of consecutive $1$'s in nums if you are allowed to flip at most k zeros to ones.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• nums[i] is either $0$ or ...