Easy-12

leetcode  485. Max Consecutive Ones          

Given a binary array, find the maximum number of consecutive 1s in this array.

Example 1:

Input: [1,1,0,1,1,1]Output: 3Explanation: The first two digits or the last three digits are consecutive 1s.    The maximum number of consecutive 1s is 3.

Note:

• The input array will only contain 0 and 1.
• The length of input array is a positive integer and will not exceed 10,000

AC:

int findMaxConsecutiveOnes(int* nums, int numsSize) {
    int result=0;
    int count=0;
    for(int i=0;i<numsSize;i++)
    {
        if(nums[i]==1)
        {
            count++;
        }
        else
        {
            if(result<count)
            {
                result=count;
            }
            count=0;
        }
    }
   
    return result>count?result:count;
}