Max Consecutive Ones Problem

1
2
3
Input: nums = [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.

1
2
Input: nums = [1,0,1,1,0,1]
Output: 2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int n = nums.size();
        int maxones = 0;
        int currones = 0;
        for (int i = 0; i < n; i ++) {
            if (nums[i] == 1) {
                currones ++;
                maxones = max(maxones, currones);
            } else {
                currones = 0;
            }
        }
        return maxones;
    }
};