LeetCode 485. Max Consecutive Ones

Problem Statement

(Source) 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

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