Max Consecutive Ones Python Solution

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

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

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