Java
public class Solution {
public int findMaxConsecutiveOnes(int[] nums) {
int count=0;
int result=0;
for(int i=0;i<nums.length;i++)
{
if(nums[i]==1)
{
count++;
result=result<count?count:result;
}
else
{
count=0;
}
}
return result;
}
}
