Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
/*
输入 8 7
6 7 8 10 11 2 3 4
输出1
*/
#include <iostream>
using namespace std;
int a[1000];
//二分查找
int search(int a[],int n,int target){
int l=0,r=n-1;
while(l<=r){
int mid=(l+r)/2; //mid=3 a[mid]=10
if(a[mid]==target){
return mid;
}
if(a[l]<=a[mid]){ //说明在未旋转部分
if(a[l]<=target&&target<=a[mid]){
r=mid-1;
}
else
l=mid+1;// 在【10,11】
}
else{
if(a[mid]<=target&&target<=a[r]){
l=mid+1;
}
else
r=mid-1;
}
}
return -1;
}
int main()
{
int n,target;
cin>>n>>target;
for(int i=0;i<n;i++){
cin>>a[i];
}
int result=search(a,n,target);
cout<<result<<endl;
}