Max Consecutive Ones III

Problem 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. (link) Example 1: Input: nums = [1,1,1,0,0,0,1,1,1,1,0], k