Lc1752.-Check-if-Array-is-Sorted-and-Rotated.java

class Solution {
    public boolean check(int[] nums) {
        int n=nums.length;
        int c=0;
        for(int i=0;i<n;i++){
            if(nums[i]>nums[(i+1)%n]) c++;
            if(c>1) return false;
        }
        return true;
    }
}