题目描述
把一个数组最开始的若干个元素搬到数组的末尾,我们称之为数组的旋转。输入一个非递减序列的一个旋转,输出旋转数组的最小元素。例如数组{3,4,5,1,2}为{1,2,3,4,5}的一个旋转,该数组的最小值为1。
注意:选要考虑数组多个相同2,2,1,2,2:
import java.util.ArrayList;
public class Solution {
public int minNumberInRotateArray(int [] array) {
if(array == null || array.length ==0){
return 0;
}
int index1 = 0;
int index2 = array.length -1;
int indexMid = index1;
while(array[index1] >=array[index2]){
if(index2 -index1 == 1){
return array[index2];
}
indexMid = index1 +(index2 -index1)/2;
if(array[indexMid] == array[index1] || array[index2] == array[indexMid]){
return midOrder(array,index1,index2);
}
if(array[indexMid] >= array[index1]){
index1 = indexMid;
}
else if(array[indexMid] <= array[index2]){
index2 = indexMid;
}
}
return array[indexMid];
}
private int midOrder(int[] array, int index1, int index2) {
int result = array[index1];
int i = index1 +1;
for(;i<= index2;i++){
if(result >array[i]){
result =array[i];
}
}
return result;
}
}