Leetcode 485. Max Consecutive Ones (Java)

Given a binary array nums, return the maximum number of consecutive 1's in the array.

Example 1:

Input: nums = [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.

Example 2:

Input: nums = [1,0,1,1,0,1]
Output: 2

Constraints:

• 1 <= nums.length <= 105
• nums[i] is either 0 or 1.

class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int count=0;
        int output=0;
        ArrayList<Integer> arrlist = new ArrayList<Integer>(5);
        for(int i=0;i<nums.length;i++)
        {
            if(nums[i]==1)
            {
                count++;
                arrlist.add(count);
            }
            else
            {
                count=0;
                arrlist.add(count);
            }
        }
        
        Collections.sort(arrlist);

        System.out.print(arrlist);
        output=arrlist.get(arrlist.size()-1);
        System.out.println(output);
        return output;
    }
    
    
    
}