Practice/Meta/Leetcode 1004. Max Consecutive Ones III

Leetcode 1004. Max Consecutive Ones III

CodingMust

Problem

You are given a binary array nums (containing only 0s and 1s) and an integer k. You can flip at most k zeros to ones. Your goal is to find the maximum number of consecutive 1s in the array after performing these flips optimally.

Requirements

1. Return the length of the longest contiguous subarray containing only 1s after flipping at most k zeros
2. The original array should not be modified
3. Handle edge cases including empty arrays, arrays with all zeros, and arrays with all ones

Constraints

• 1 ≤ nums.length ≤ 100,000
• nums[i] is either 0 or 1
• 0 ≤ k ≤ nums.length
• Time complexity: Aim for O(n) where n is the length of the array
• Space complexity: Aim for O(1) additional space

Examples

Example 1:

Input: nums = [1,1,1,0,0,0,1,1,1,1,0], k = 2 Output: 6 Explanation: By flipping the zeros at indices 4 and 5, we get: [1,1,1,0,0,1,1,1,1,1,1] The bold sequence [0,1,1,1,1,1,1] has length 6 (after flipping index 4).

Example 2:

Input: nums = [0,0,1,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1], k = 3 Output: 10 Explanation: Flip the zeros at indices 5, 9, and 12 to maximize consecutive ones.

Example 3:

Input: nums = [1,1,1,1], k = 0 Output: 4 Explanation: No flips needed; the array already has 4 consecutive ones.