main.cpp

// Source: https://leetcode.com/problems/max-consecutive-ones
// Title: Max Consecutive Ones
// Difficulty: Easy
// Author: Mu Yang <http://muyang.pro>

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Given a binary array `nums`, return the maximum number of consecutive `1`'s in the array.
//
// **Example 1:**
//
// ```
// 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.
// ```
//
// **Example 2:**
//
// ```
// Input: nums = [1,0,1,1,0,1]
// Output: 2
// ```
//
// **Constraints:**
//
// - `1 <= nums.length <= 10^5`
// - `nums[i]` is either `0` or `1`.
//
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

#include <vector>

using namespace std;

class Solution {
 public:
  int findMaxConsecutiveOnes(vector<int>& nums) {
    auto ans = 0;
    auto curr = 0;
    for (auto num : nums) {
      if (num == 1) {
        ++curr;
        ans = max(ans, curr);
      } else {
        curr = 0;
      }
    }

    return ans;
  }
};