算法练习(19) - 查找循环有序数组任一数值的位置

import java.util.*;
public class Main {
    public static void main(String[] args) {
        
        int[] arr = {3,4,5,6,8,9,11,0,1,2};
        int left = 0;
        int right = arr.length -1;
        int target = 11;
        
        int index = getNumberIndex(arr ,left,right,target);
        System.out.print(index);
    }
    
    public static int getNumberIndex(int[] arr ,int left,int right,int target) {
        if(left == right){
            if(arr[left] == target){
                return left;
            }else {
               return -1; 
            }
        }
        int middle =  (left + right) / 2;
        int respre = getNumberIndex(arr,left,middle,target);
        int ressuf =  getNumberIndex(arr,middle + 1,right,target);
        return respre == -1 ? ressuf : respre;
    }
}