class Solution {
    public boolean isMonotonic(int[] nums) {
        int countI=0, countD=0, l=nums.length;
        for(int i=0; i<l-1; i++){
            if(nums[i] == nums[i+1]){
                countI++;
                countD++;
            }
            else if(nums[i] < nums[i+1]) countI++;
            else countD++;
        }
        
        return countI == l-1 || countD == l-1;
    }
}