leetcode 485

int findMaxConsecutiveOnes(int* nums, int numsSize) {
int i,max=0,tmp=0;
for (i = 0;i < numsSize;i++)
{
if (nums[i])
tmp++;
else
{
if (max < tmp)
max = tmp;
tmp = 0;
}
}
return max>tmp?max:tmp;//aimed to the input [1…1]
}