class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int res = 0;
int cur = 0;
int count = 0;
while(cur <nums.size())
{
if(nums[cur] == 1)
{
count++;
}else{
count = 0;
}
cur++;
res = max(res,count);
}
return res;
}
};