1,题目描述
2,代码实现
int findMaxConsecutiveOnes(vector<int>& nums) {
int count=0,res=0;
for(int i=0;i<nums.size();++i){
if(nums[i]==1)
++count;
else{
res=res>count?res:count;
count=0;
}
}
res=res>count?res:count;
return res;
}