Max Consecutive Ones LeetCode solution in Python

1
class Solution:
2
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
3

4
        count = maxCount = 0
5

6
        for i in range(len(nums)):
7
            if nums[i] == 1:
8
                count += 1
9
            else:
10
                maxCount = max(count, maxCount)
11
                count = 0
12

13
        return max(count, maxCount)