Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 487 with 12 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 487 # by problem number
lcpy gen -s max_consecutive_ones_ii # by problem name
nums, return the maximum number of consecutive 1’s in the array if you can flip at most one 0.
Follow up: What if the input numbers come in one by one as an infinite stream? In other words, you can’t store all numbers coming from the stream as it’s too large to hold in memory. Could you solve it efficiently?
Input: nums = [1,0,1,1,0]
Output: 4
Explanation:
- If we flip the first zero, nums becomes [1,1,1,1,0] and we have 4 consecutive ones.
- If we flip the second zero, nums becomes [1,0,1,1,1] and we have 3 consecutive ones.
The max number of consecutive ones is 4.
Input: nums = [1,0,1,1,0,1]
Output: 4
Explanation:
- If we flip the first zero, nums becomes [1,1,1,1,0,1] and we have 4 consecutive ones.
- If we flip the second zero, nums becomes [1,0,1,1,1,1] and we have 4 consecutive ones.
The max number of consecutive ones is 4.
1 <= nums.length <= 10^5nums[i] is either 0 or 1.class Solution:
# Time: O(n)
# Space: O(1)
def find_max_ones(self, nums: list[int]) -> int:
left = zeros = best = 0
for right, value in enumerate(nums):
if value == 0:
zeros += 1
while zeros > 1:
if nums[left] == 0:
zeros -= 1
left += 1
best = max(best, right - left + 1)
return best
| Time | Space |
|---|---|
| O(n) | O(1) |