【leetcode】最大连续1的个数

int findMaxConsecutiveOnes(int* nums, int numsSize){
    int max=0,sum=0,i;
    for (i=0; i<numsSize; i++)
    {
        if (nums[i]) 
        {
            sum++;
            if (i == numsSize-1 || nums[i] != nums[i+1])
            {
                if (sum > max) max=sum;
                sum=0;
            }
        }
    }
    return max;
}