class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int maximum = -1,count=0;
        for(int i=0;i<nums.length;i++){
            if(nums[i] == 1){
                count++;
            }else{
                if(count > maximum){
                    maximum=count;
                }
                count=0; 
            }
        }
        if(count > maximum){
            maximum=count;
        }
        return maximum;
    }
}