题目网址:点击打开链接
题目描述: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 max=0,re=0;//max=最大1连续数,re=当前1连续数
for(int i=0;i<nums.size();i++){
if(nums[i])re++;
if(max<re)max=re;
if(!nums[i]){
re=0;
}
}
return max;
}
};