剑指offer第8题 旋转数组 九度OJ1386

 

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;

#define Max_Num  1000005
int arr[Max_Num];

int midInOrder(int arr[],int index1,int index2)
{
	int min = arr[index1];
	for(int i = index1+1;i <=index2;i++)
	{
		if(arr[i] < min)
			min = arr[i];
	}
	return min;
}
int solve(int arr[],int length)//二分查找
{
	if(arr == NULL || length <= 0)
		return 999999;
	int index1,index2,mid;
	index1 = 0;
	index2 = length - 1;
	mid = index1;
	while(arr[index1] >= arr[index2])
	{
		if(index2 - index1 == 1)
		{
			mid =  index2;
			break;
		}
		mid = (index1 + index2) / 2;
		if( arr[index1] == arr[index2] && arr[index1] == arr[mid])
			return midInOrder(arr,index1,index2);//如果三个位置元素相等，则无法判断在左半边还是右半边，需要顺序查找
		if(arr[mid] >= arr[index1])
			index1 = mid;
		else if(arr[mid] <= arr[index2])
			index2 = mid;
	}
	return arr[mid];
}

int main()
{
	//freopen("8.txt","r",stdin);
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		memset(arr,0,sizeof(arr));
		for(int i = 0;i < n;i++)
			scanf("%d",&arr[i]);
		printf("%d\n",solve(arr,n));
	}
	return 0;
}