[LeetCode] 33. Search in Rotated Sorted Array 在旋转有序数组中搜索

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int l = 0, r = nums.size()-1;
        while(l<=r){
            int mid = l + (r-l)/2;
            int curr = nums[mid];
            int rval = nums[r];
            int lval = nums[l];
            if(target==curr) return mid;
            // 后半有序，改等号是需要判断是否可能只有两个数
            if(curr<=rval){
                // 在此区间内
                if(target>curr && target<=rval)
                    l = mid+1;
                else
                    r = mid-1;
            } else {
                // 前半段有序且在区间内
                if(target>=lval && target<curr)
                    r = mid-1;
                else
                    l = mid+1;
            }
        }
        return -1;
    }
};