Leetcode #485 Max Consecutive Ones

Description

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

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

Example

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.

Code

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