Leetcode_Array_Max Consecutive Ones

Tag:
Array
Difficulty:
Easy
Description:
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.
Code:

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