longest-subarray-with-maximum-bitwise-and.java

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