033. Search in Rotated Sorted Array [Medium][未通过]

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

有序序列查找——二分查找

int l = 0,r = num.size() - 1;
while(l <= r){
int mid = (l + r)/2;
if(num[mid] == target)return mid;
else if(num[mid] < target){
l = mid + 1;
}else r = mid - 1;
}

这题不是完全有序，是局部有序的。基于二分查找的模板进行变形。