LeetCode 33. 搜索旋转排序数组

class Solution {
public:
    int search(vector<int>& nums, int target) {
        if(nums.empty()) return -1;
        int l = 0, r = nums.size() - 1;
        // 寻找两端数组的边界
        while(l < r)
        {
            int mid = l + r + 1 >> 1;
            // 性质在左边
            if(nums[mid] >= nums[0]) l = mid;
            else r = mid - 1;
        }

        if(target >= nums[0]) l = 0;
        else
        {
            l = r + 1;
            r = nums.size() - 1;
        } 
		// 在第一段数组或者第二段数组中寻找那个数字
        while(l < r)
        {
            int mid = l + r >> 1;
            // 性质在右边
            if(nums[mid] >= target) r = mid;
            else l = mid + 1;
        }

        if(nums[r] == target) return r;
        else return -1;
    }
};