剑指offer面试题8--数组旋转

//二分查找的思想，当中间元素比左边元素大，那么被查找数组在右边字数组中，将中间元素索引赋值给左边元素索引

当中间元素比右边元素小，那么被查找元素在左边字数组，将中间元素索引赋值给右边元素索引

当左右元素索引相差为1即找到对应元素

public Integer minInReversingList(int[] array)

{
if(array==null)
return null;
int leftIndex=0;
int rightIndex=array.length-1;
int mid=1;
while(array[leftIndex]>=array[rightIndex])
{
if(rightIndex-leftIndex<=1)
{
mid=rightIndex;
break;
}
mid=(leftIndex+rightIndex)/2;
if(array[leftIndex]==array[rightIndex] && array[leftIndex]==array[mid])
{
if(array[leftIndex+1]!=array[rightIndex-1])
{
mid=array[leftIndex+1]<array[rightIndex-1]?leftIndex+1:rightIndex-1;
break;
}
else
{
leftIndex++;
rightIndex--;
}

}
else {
if(array[mid]>=array[leftIndex])
leftIndex=mid;
else {
if(array[mid]<=array[rightIndex])
rightIndex=mid;
}
}
}
return array[mid];
}
}