题目:把一个数组最开始的若干个元素搬到数组的末尾,我们称之为数组的旋转。输入一个递增排序的数组的一个旋转,输出旋转数组的最小元素。例如,数组{3,4,5,1,2}为{1,2,3,4,5}的一个旋转,该数组的最小值为1。
代码如下:
#include<stdio.h>
#include<string.h>
int midOrder(int num[],int low,int high){
int minValue = num[low];
for(int i=low;i<=high;i++){
if(num[i]<minValue){
minValue = num[i];
}
}
return minValue;
}
int MinValue(int* num,int low,int high){
if(num==NULL){
return -1;
}
while(num[low]>=num[high]){
int mid = (low+high)/2;
if(high - low == 1){
return num[high];
}
if(num[high]==num[low]&&num[high]==num[mid]){
return midOrder(num,low,high);
}
if(num[mid]>=num[low]){
low = mid;
}
else{
high = mid;
}
}
return num[low];
}
int main(){
//int num[] = {3,4,5,1,2};
//int num[] = {2,1};
//int num[] = {3,4,5,6,1,2};
//int num[] = {1,0,1,1,1};
//int num[] = {1,1,1,0,1};
//int num[] = {1};
//int num[] = {1,2,3,4,5};
//int k = MinValue(num,0,1);
//int k = MinValue(num,0,4);
int k = MinValue(NULL,0,0);
printf("%d",k);
return 0;
}