[LeetCode&Python] Problem 485. Max Consecutive Ones

转载于 2018-10-27 09:44:00 发布 · 64 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/chiyeung/p/9860211.html

文章标签：

#python

本文介绍了一种在二进制数组中找到最长连续1序列的方法。通过遍历数组，使用计数器跟踪当前连续1的数量，并在遇到0时更新最大连续1的记录，最后返回最大的连续1序列长度。

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
        """
        maxn=0
        cur=0
        
        for i in nums:
            if i==1:
                cur+=1
            else:
                if cur>maxn:
                    maxn=cur
                cur=0
        
        if cur>maxn:
            maxn=cur
        
        return maxn

转载于:https://www.cnblogs.com/chiyeung/p/9860211.html