485. Max Consecutive Ones

最新推荐文章于 2024-12-07 07:15:00 发布

原创最新推荐文章于 2024-12-07 07:15:00 发布 · 98 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

88 篇文章

订阅专栏

本文介绍了一种寻找二进制数组中最长连续1子数组的方法。通过遍历数组并使用两个变量来跟踪当前连续1的数量及历史最大连续1数量，最终得出最长连续1子数组的长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

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