根据我自己的二分模板写的答案:
题目思路依旧是:将数组一分为二,找出有序的部分,判断目标值在不在里面。
class Solution {
public:
int search(vector<int>& nums, int target) {
int left = 0;
int right = nums.size()-1;
while(left<right){
int mid = (left+right)/2;
if(nums[left] <= nums[mid]){
if(nums[left] <= target && nums[mid]>=target){
right = mid;
}else{
left=mid+1;
}
}else if(nums[left]>nums[mid]){
if(nums[right] >= target && nums[mid]<target){
left = mid+1;
}else {
right = mid;
}
}
}
return nums[right] == target? right :-1;
}
};
习惯用while(left<right);mid = (left+right)/2,left = mid+1,right = mid;这种模板