LeetCode - Max Consecutive Ones

原题网址：
https://leetcode.com/problems/max-consecutive-ones/#/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.
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

题解： 无

代码：

class Solution(object):
    def findMaxConsecutiveOnes(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        count = 0
        maxcount = 0
        for item in nums:
            if(item==1):
                count += 1
            else:
                if maxcount<count:
                    maxcount = count
                count = 0
        if maxcount<count:
            maxcount = count
        return maxcount