检查数组是否为Java中的旋转方法？

public class RotateArrayChecker {
    public static boolean isRotated(int[] arr) {
        if (arr == null || arr.length == 0) {
            return false;
        }
        
        int minIndex = findMinIndex(arr);
        
        if (minIndex == 0) {
            return false;
        } else {
            return true;
        }
    }
    
    private static int findMinIndex(int[] arr) {
        int left = 0;
        int right = arr.length - 1;
        
        while (left < right) {
            int mid = left + (right - left) / 2;
            
            if (arr[mid] > arr[right]) {
                left = mid + 1;
            } else if (arr[mid] < arr[right]) {
                right = mid;
            } else {
                right--;
            }
        }
        
        return left;
    }
}