class Solution {
public:
int findMaxConsecutiveOnes(vector& nums) {
int len = nums.size();
int temp = 0;
int num = 0;
for(int k = 0;k < len;k++)
{
if(nums[k] == 1)
{
num++;
temp = max(temp,num);
}else
{
num = 0;
}
}
return temp;
}
};
时刻更新连续数



