【LeetNode2-1-3】Search in rotated sorted array I--C++源代码（VS2015）

#include <iostream>
#include <vector>
using namespace std;

/*
Search in rotated sorted array I
有序无重复序列在某一点进行旋转后，在新序列中查找某一个数
eg:1,2,3,4,5,6,7 --> 5,6,7,1,2,3,4
*/

int Solution(vector<int> &vec,int target)
{
if (0 == vec.size())
return -1;
int first = 0;
int last = vec.size();

while (first != last)
{
int quote = first + (last - first) / 2;
if (target == vec[quote])
return quote;
if (vec[first] < vec[quote])
{
if (vec[first] <= target&& target < vec[quote])
{
last = quote;
}
else
{
first = quote+1;
}
}
else
{
if (vec[quote] < target&& target <= vec[last-1])
{
first = quote+1;
}
else
{
last = quote;
}
}
}  

return -1;
}

int main()
{
int arr[] = { 6,7,8,9,0,1,2,3,4,5 };
vector<int> vec(&arr[0], &arr[10]);
for (int i = 0; i < vec.size(); i++)
cout << vec[i] << " ";
cout << endl;
int target_index = Solution(vec,5);
if (-1 == target_index)
cout << "can not find it" << endl;
else
cout << "find it,index is "<< target_index << endl;
system("pause");
return 0;
}