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 len = nums.size();
int max = 0;
int now = 0;
for(int i = 0; i < len; i++){
if(nums[i] == 0){
now = 0;
}else{
now++;
if(now > max)
max = now;
}
}
return max;
}
};