Leetcode Problem 1004. Max Consecutive Ones III

1004. Max Consecutive Ones III

Leetcode Solutions

Initialize two pointers left and right to 0, and max_length to 0 to keep track of the maximum length of the window.
Use the right pointer to iterate through the array.
If a zero is encountered and k is greater than 0, decrement k.
If k is 0 and a zero is encountered, increment the left pointer until a zero is discarded from the window.
Update max_length with the maximum of max_length and the current window size (right - left + 1).
Return max_length as the result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen