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