Max Consecutive Ones Python Solution

Tested Python solution for LeetCode 485 with 12 pytest cases. Generate a practice environment with lcpy.

LeetCode 485, Easy. Topics: Array. View on LeetCode.

Generate this problem as a practice environment: tested reference solution, 12 parametrized pytest cases, and a playground notebook:

lcpy gen -n 485   # by problem number
lcpy gen -s max_consecutive_ones   # by problem name

​

Problem

Given a binary array nums, return the maximum number of consecutive 1’s in the array.

​

Examples

Input: nums = [1,1,0,1,1,1]
Output: 3
Explanation: The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3.

Input: nums = [1,0,1,1,0,1]
Output: 2

​

Constraints

• 1 <= nums.length <= 10^5
• nums[i] is either 0 or 1.

​

Solution

Reference implementation from solution.py on GitHub, full suite in test_solution.py:

class Solution:
    # Time: O(n)
    # Space: O(1)
    def find_max_consecutive_ones(self, nums: list[int]) -> int:
        best = 0
        current = 0
        for num in nums:
            if num == 1:
                current += 1
                best = max(best, current)
            else:
                current = 0
        return best

​

Complexity

Time	Space
O(n)	O(1)

​

Tags

NeetCode All.