hot100_33. 搜索旋转排序数组

class Solution {
    public int search(int[] nums, int target) {
        int n = nums.length;
        int l=0,r=n-1;
        int max=0,maxindex = 0;
        for(int i=0;i<n;i++){
            if(nums[i]> max){
                max = nums[i];
                maxindex = i;
            }
        }
        if(target == nums[0]){
            return 0;
        }
        if(target < nums[0]){
            l = maxindex+1;
        }
        if(target <= max && target >= nums[0]){
            r = maxindex;
        }
        while(l<=r){
            int mid = (l+r)/2;
            if(nums[mid]==target){
                return mid;
            }else if(nums[mid]>target){
                r = mid-1;
            }else{
                l = mid+1;
            }
        }
        return -1;
    }
}