题解 | #在旋转过的有序数组中寻找目标值#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param nums int整型vector 
     * @param target int整型 
     * @return int整型
     */
    int search(vector<int>& nums, int target) {
        // write code here
        int left=0, right = nums.size()-1;
        
        while(left <= right){
            int mid = left + (right - left) / 2;
            if(nums[mid] == target){
                return mid;
            }
            if(nums[mid] >= nums[left]){
                if(target > nums[mid] || (target < nums[mid] && target < nums[left])){
                    left = mid+1;
                }
                else{
                    right = mid-1;
                }
            }
            else if(nums[mid] <= nums[right]){
                if(target < nums[mid] || (target > nums[mid] && target > nums[right])){
                    right = mid-1;
                }
                else{
                    left = mid+1;
                }
            }
        }
        return -1;
    }
};