LeetCode#33搜尋旋轉排序陣列

33. 搜尋旋轉排序陣列

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