/*******************************************************************
*《剑指Offer——名企面试官精讲典型编程题》C++代码
*
* htfeng
* 2018.09.21
*
* 面试题11: 旋转数组的最小数字
* 题目: 把一个数组最开始的若干个元素搬到数组的末尾,我们称之为数组的旋转。
* 输入一个递增排序的数组的一个旋转,输出旋转数组的最小元素
*******************************************************************/
#include<iostream>
#include<exception>
using namespace std;
int MinInOrder(int* numbers, int index1, int index2);
int Min(int* numbers, int length) {
if (numbers == nullptr || length <= 0)
throw new std::exception("Invaild paramter");
int index1 = 0;
int index2 = length - 1;
int indexMid = index1;
while (numbers[index1] >= numbers[index2]) {
if (index2 - index1 == 1) {
indexMid = index2;
break;
}
indexMid = (index1 + index2) / 2;
if (numbers[index1] == numbers[index1] && numbers[index1] == numbers[indexMid])
return MinInOrder(numbers, index1, index2);
if (numbers[indexMid] >= numbers[index1])
index1 = indexMid;
else if (numbers[indexMid] <= numbers[index2])
index2 = indexMid;
}
return numbers[indexMid];
}
int MinInOrder(int* numbers, int index1, int index2) {
int result = numbers[index1];
for (int i = index1 + 1; i <= index2; i++) {
if (result > numbers[i])
result = numbers[i];
}
return result;
}
面试题11: 旋转数组的最小数字
最新推荐文章于 2021-03-09 23:39:14 发布