Max Consecutive Ones III with K Zero Flips

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. ### Constraints - `1 <= nums.length <= 10^5` - `nums[i]` is either `0` or `1`. - `0 <= k <= nums.length` ### Input Format First line contains the integer `k`. Second line contains space-separated integers of `nums`. ### Output Format Print the maximum length of contiguous ones attainable.