33. 搜索旋转排序数组

package binSearch;

public class search_33 {
    public int search(int[] nums, int target) {
        int left = 0;
        int right = nums.length-1;
        int mid = (left+right)/2;

        while (left<=right) {
            mid = (left+right)/2;

            //左边有序
            if (nums[mid]>nums[left]){

                //先在有序区间里找
                //目标值在有序范围内
                if (target<=nums[mid] && target>=nums[left]){
                    return  binSea(nums, left, mid, target);
                }

                //有序区间没有再去无序区间找
                left = mid+1;

            }else {
                //右边有序
                if (target>nums[mid]&&target<nums[right]){
                    return binSea(nums,mid,right,target);
                }
                right=mid-1;
            }
        }


        return -1;
    }

    public int binSea(int[]nums,int left,int right,int target){
        int mid;
        while (left<=right){
            mid = (left+right)/2;
            if (nums[mid]==target){
                return mid;
            }else if (nums[mid]>target){
                right = mid-1;
            }else {
                left = mid+1;
            }
        }
        return -1;
    }

    public static void main(String[] args) {
        int[] arr = {4, 5, 6, 7, 0, 1, 2};
        int target = 9;
        search_33 fun = new search_33();
        int result = fun.search(arr, target);
        System.out.println(result);
    }
}