Leetcode in C-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: 3
Explanation: 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

Input:

[1,0,1,1,0,1]

My Code:

int findMaxConsecutiveOnes(int* nums, int numsSize){
    int count=0,max=0;
    for(int i=0;i<numsSize;i++){
        if(nums[i]==1){
            count=count+1;
            if(count>max){
                max=count;
            }
        }
        else{
            count=0;
        }
        printf("count:%d\n",count);
        printf("max:%d\n\n",max);
    }
    return max;
}

Output:

count:1
max:1

count:0
max:1

count:1
max:1

count:2
max:2

count:0
max:2

count:1
max:2

Your answer(return value):

2