# 485. 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

```cpp
int findMaxConsecutiveOnes(vector<int>& nums) { // time: O(n); space: O(1)
    int res = 0, cur = 0;
    for (int num : nums) {
        if (num == 1) res = max(res, ++cur);
        else cur = 0;
    }
    return res;
}
```
