题目:把一个数组最开始的若干个元素搬到数组的末尾,我们称之为数组的旋转。输入一个递增排序的数组的一个旋转,输出旋转数组的最小值。例如,数组{3,4,5,1,2}为{1,2,3,4,5}的一个旋转,该数组的最小值为1
#include <iostream>
#include <vector>
using namespace std;
int getMin(vector<int> buf, int index1, int index2)
{
int retNum = buf[index1];
for (int i = index1; i <= index2; ++i)
{
if (retNum > buf[i])
retNum = buf[i];
}
return retNum;
}
int binarySearch(vector<int> buf)
{
int index1 = 0;
int index2 = buf.size() - 1;
int retIndex = index1;
while (buf[index1] >= buf[index2])
{
if (index2 - index1 == 1)
{
retIndex = index2;
break;
}
int midIndex = (index1 + index2) / 2;
if (buf[midIndex] == buf[index1] && buf[midIndex] == buf[index2])
return getMin(buf, index1, index2);
if (buf[midIndex] >= buf[index1])
index1 = midIndex;
else if (buf[midIndex] <= buf[index2])
index2 = midIndex;
}
return buf[retIndex];
}
int main()
{
vector<int> data{ 8, 9, 4, 5, 6 };
cout << binarySearch(data);
}