leetcode33——Search in Rotated Sorted Array

题目大意：在旋转排序数组中搜索目标数字是否存在

分析：二分搜索的变形。直接搜肯定可以，但是由于是旋转排序数组，所以可以改善二分搜索的算法以得到更高的搜索效率。

代码：转载自https://yq.aliyun.com/articles/861

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int l = 0, r = nums.size()-1;
        while (l<=r) {
            int mid = (r-l)/2+l;
            if (nums[mid] == target)
                return mid;
            if (nums[mid] < nums[r]) {
                if (nums[mid]<target && target<=nums[r])
                    l = mid+1;
                else
                    r = mid-1;
            } else {
                if(nums[l]<=target && target<nums[mid])
                    r = mid-1;
                else
                    l = mid+1;
            }
        }
        return -1;
    }
};