题目:一个有序数组(如{1,2,3,4,5,6,7})前后两部分旋转(变为{4,5,6,7,1,2,3})后,查找数组中的最小值。
大致思路,利用二分查找法:线比较array[left](4)与array[middle](7)的值,若array[middle]的值大于array[left],则说明从array[left]到array[middle]这一段包含在值都比较大的那一段中,而最小值肯定出现在array[middle]到array[right]之间,因此相应的调整left、middle、right的值继续执行和前一步一样的操作,指导left与right相邻。
注:数组中没有重复元素。
下面C/C++代码可供参考:
#include<stdio.h>
int find_min_after_sort_then_rotate(int[],int);
int main()
{
int array_1[]={3,4,5,6,7,1,2,3};
int array_2[]={4,6,7,9,15,18,28,1,2,3};
int array_3[]={45};
int min_of_array_1,min_of_array_2,min_of_array_3;
min_of_array_1=find_min_after_sort_then_rotate(array_1,0);
if(min_of_array_1!=-1)
printf("minimum value in array_1 is:%d\n",min_of_array_1);
min_of_array_2=find_min_after_sort_then_rotate(array_2,10);
if(min_of_array_2!=-1)
printf("minimum value in array_2 is:%d\n",min_of_array_2);
min_of_array_3=find_min_after_sort_then_rotate(array_3,1);
if(min_of_array_3!=-1)
printf("minimum value in array_3 is:%d\n",min_of_array_3);
return 0;
}
int find_min_after_sort_then_rotate(int array_temp[],int number_of_members)
{
switch(number_of_members)
{
case 0:printf("too few members in the array\n");
return -1;
case 1:return array_temp[0];
}
int min_in_array;
int left=0,right=number_of_members-1,mid;
while(left!=(right-1))
{
mid=(left+right)/2;
if(array_temp[mid]>array_temp[left])
{
left=mid;
}
else
right=mid;
}
min_in_array=array_temp[left]<array_temp[right]?array_temp[left]:array_temp[right];
return min_in_array;
}