485. Max Consecutive Ones-最大连续1的个数

Given a binary array, find the maximum number of consecutive 1s in this array.

Example 1:
Input: [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.

Note:
The input array will only contain 0 and 1.
The length of input array is a positive integer and will not exceed 10,000

Solution in python:

class Solution:
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
        i = 0
        max_len = 0
        count = 0
        while i < len(nums):
            if nums[i] == 1:
                count += 1
            else:
                count = 0
            if count > max_len:
                max_len = count
            i += 1
        return max_len