485. Max Consecutive Ones

int findMaxConsecutiveOnes(vector<int>& nums) {
int max=0,sum=0;
for(int i=0;i<nums.size();i++){
if(nums[i])
sum++;
if(sum&&!nums[i]){
max=max<sum?sum:max;
sum=0;
}
}
max=max<sum?sum:max;
return max;
}