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.


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


class Solution(object):
    def findMaxConsecutiveOnes(self, nums):
        :type nums: List[int]
        :rtype: int
        maximum = 0
        imum = 0
        for i in nums:
            if i == 1:
                imum += 1
                maximum = max(maximum, imum)
                imum = 0
        return maximum


电子邮件地址不会被公开。 必填项已用*标注