点击打开链接
//拆成两半,两半都是有序的,左半边严格大于右半边
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<cstring>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
#include<limits.h>
#include<assert.h>
#define LL long long
#define inf 0x3f3f3f3f
#define mod 1e9+7
using namespace std;
class Solution {
public:
int search(vector<int>& nums, int target) {
int start=0;
int end=nums.size()-1;
while (start<=end) {
int mid=(start+end)/2;
if(nums[mid]==target){
return mid;
}
if(nums[start]<=nums[mid]){// 肯定在左半边.二分
if(nums[start]<=target&&target<=nums[mid]){
end=mid-1;
}
else{
start=mid+1;
}
}
else{//在右半边,二分
if(nums[mid]<=target&&target<=nums[end]){
start=mid+1;
}
else{
end=mid-1;
}
}
}
return -1;
}
};
int main()
{
Solution temple;
return 0;
}