LeetCode 1004: Max Consecutive Ones III Solution

Master LeetCode problem 1004 (Max Consecutive Ones III), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1004. Max Consecutive Ones III

Medium

Array Binary Search Sliding Window Prefix Sum

Problem Explanation

Explanation:

To solve this problem, we can use a sliding window approach. We will maintain a window that contains at most k zeros. As we iterate through the array, we will expand the window until we have more than k zeros in the window. At this point, we will shrink the window from the left side until we satisfy the constraint of at most k zeros in the window again. We will keep track of the maximum window size encountered during the process.

Here are the steps:

Initialize variables - left pointer, right pointer, zeroCount to count zeros in the window, and maxConsecutiveOnes to store the maximum consecutive ones encountered.
Iterate through the array using the right pointer and expand the window.
If a zero is encountered, increment zeroCount.
If zeroCount exceeds k, shrink the window from the left side until zeroCount is less than or equal to k.
Update maxConsecutiveOnes with the maximum window size.
Repeat steps 2-5 until the end of the array is reached.
Return maxConsecutiveOnes. :

Solution Code

class Solution {
    public int longestOnes(int[] nums, int k) {
        int left = 0, zeroCount = 0, maxConsecutiveOnes = 0;
        
        for (int right = 0; right < nums.length; right++) {
            if (nums[right] == 0) {
                zeroCount++;
            }
            
            while (zeroCount > k) {
                if (nums[left] == 0) {
                    zeroCount--;
                }
                left++;
            }
            
            maxConsecutiveOnes = Math.max(maxConsecutiveOnes, right - left + 1);
        }
        
        return maxConsecutiveOnes;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1004 (Max Consecutive Ones III)?

This page provides optimized solutions for LeetCode problem 1004 (Max Consecutive Ones III) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1004 (Max Consecutive Ones III)?

The time complexity for LeetCode 1004 (Max Consecutive Ones III) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1004 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1004 in Java, C++, or Python.

Back to LeetCode Solutions