count maximum consecutives ones 1

  static int findMaxConsecutiveOnes(int nums[]) {

        int cnt = 0;
        int maxi = 0;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == 1) {
                cnt++;
            } else {
                cnt = 0;
            }

            maxi = Math.max(maxi, cnt);
        }
        return maxi;

//maximum consecutives bit ones and zeros

class Solution {
    public int maxConsecBits(int[] arr) {
        // code here
        int n=arr.length;
        int count=1;
        int maxi=1;
        for(int i=1; i<n; i++){
            if(arr[i]==arr[i-1]){
                count++;
            }else{
                count=1;
            }
            maxi=Math.max(maxi,count);
        }
        return maxi;
    }
}