LeetCode Max Consecutive Ones

最新推荐文章于 2021-02-27 14:47:21 发布

wdkirchhoff

最新推荐文章于 2021-02-27 14:47:21 发布

阅读量365

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/wdkirchhoff/article/details/64479458

版权

LeetCode 专栏收录该内容

46 篇文章

订阅专栏

本文介绍了一种高效的方法来找出二进制数组中最大数量的连续1。通过两种不同的实现方式，展示了如何解决这个问题，并提供了具体的Python代码示例。

摘要生成于 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.
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
        """
        mmax = 0
        count = 0
        for i in nums:
            if i == 1:
                count += 1
            else:
                if count > mmax:
                    mmax = count
                count = 0
        if count>mmax:
            mmax=count

        return mmax

class Solution2(object):
    def findMaxConsecutiveOnes(self, nums):
        return max(map(len, ''.join(map(str, nums)).split('0')))  #效率低一点，但是比较另类

if __name__ == '__main__':
    print Solution().findMaxConsecutiveOnes([1, 1, 0, 1, 1, 1])