LEETCODE--Max Consecutive Ones

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

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

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

137 篇文章

订阅专栏

本文介绍了一种高效算法，用于找出二进制数组中最大连续1的个数。通过遍历数组并计数连续出现的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 {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int len = nums.size();
        int max = 0;
        int now = 0;
        for(int i = 0; i < len; i++){
            if(nums[i] == 0){
                now = 0;
            }else{
                now++;
                if(now > max)
                    max = now;
            }
        }
        return max;
    }
};