33. Search in Rotated Sorted Array

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).

You are given a target value to search. If found in the array return its index, otherwise return -1.

You may assume no duplicate exists in the array.

Your algorithm’s runtime complexity must be in the order of O(log n).

Example 1:

Input: nums = [4,5,6,7,0,1,2], target = 0
Output: 4
Example 2:

Input: nums = [4,5,6,7,0,1,2], target = 3
Output: -1

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/search-in-rotated-sorted-array
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

class Solution {
    public int search(int[] nums, int target) {
        int left = 0;
        int right = nums.length-1;
        int mid = (left + right)>>>1;
        while(left <= right){
            if(nums[mid]==target)   return mid;
            
            if(nums[left] <= nums[mid]){//左边升序
                if(target>=nums[left] && target<nums[mid]){//在左边
                    right = mid-1;
                }else{
                    left = mid+1;
                }
            }else{//右边升序
                if(target>nums[mid] && target<=nums[right]){//在右边
                    left = mid+1;
                }else{
                    right = mid-1;
                }
            }

            mid = (left+right)>>>1;
        }
        return -1;
    }
}