class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int max = 0;
        int consecutive_ones = 0;
        for(int i=0;i<nums.length;i++)
        {
            if(nums[i] == 0)
            {
                max = Math.max(consecutive_ones, max);
                consecutive_ones = 0;
            }
            else
                consecutive_ones++;
        }
        max = Math.max(consecutive_ones, max);
        return max;
    }
}