Max Consecutive Ones

Max Consecutive Ones

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

Solutions

🧠 Cpp

class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums)
    {
        int res = 0, local_max = 0;
        for(auto n : nums)
        {
            if(!n)
                local_max=0;
            else if(local_max++ == res)
                ++res;
        }

        return res;
    }
};