描述

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

思路

就是设一个计数器，遇到零就清零，然后再重新计数

代码

class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int maxnum = 0;
        int count = 0;
        
        for(int i = 0; i < nums.size(); i++)
        {
            if(nums[i] == 0)
            {
                count = 0;
            }
            else
            {
                count++;
            }
            if(count > maxnum)
                maxnum = count;
        }
        
        return maxnum;
        
    }
};