LeetCode题解：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.

思路：

无

题解：

int findMaxConsecutiveOnes(const std::vector<int>& nums) {
    int longest = 0;
    int currentCount = 0;
    for(auto i: nums) {
        if (i == 1) {
            ++currentCount;
        } else {
            longest = std::max(longest, currentCount);
            currentCount = 0;
        }
    }
    longest = std::max(longest, currentCount);
    return longest;
}