> For the complete documentation index, see [llms.txt](https://anton-veselskyi.gitbook.io/codding-problems-solutions/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://anton-veselskyi.gitbook.io/codding-problems-solutions/leetcode/easy/max-consecutive-ones.md).

# Max Consecutive Ones

## [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones)

Given a binary array, find the maximum number of consecutive 1s in this array.

**Example 1:**<br>

```

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

```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;
    }
};
```