点击打开链接
#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<map>
#include<limits.h>
#include<assert.h>
#include<sstream>
#define LL long long
#define inf 0x3f3f3f3f
#define mod 1e9+7
using namespace std;
class Solution {
public:
bool search(vector<int>& nums, int target) {
if(nums.size()==0) return false;
int l=0,m=0, r=nums.size()-1;
while (l<=r) {
m=(l+r)/2;
if(nums[m]==target) return true;
if(nums[m]>nums[l]){
if(nums[m]>target&&nums[l]<=target){
r=m-1;
}
else{
l=m+1;
}
}
else if(nums[m]<nums[l]){
if(nums[m]<target&& nums[r]>=target){
l=m+1;
}
else{
r=m-1;
}
}
else{//中间和边缘相等时,边缘移动一步。
l++;
}
}
return false;
}
};
int main()
{
Solution temple;
vector<int> num;
num.push_back(1); num.push_back(3); num.push_back(1);
num.push_back(1); num.push_back(1);
cout<<temple.search(num, 3)<<endl;
return 0;
}