旋转数组的最小数字

 1 import java.util.ArrayList;
 2 public class Solution {
 3     public int minNumberInRotateArray(int[] array) {
 4            int len = array.length;
 5            if(array == null||len <1){
 6                return 0;
 7            }
 8           int index1 = 0;
 9           int index2 = len - 1;
10         int indexMid = index1;
11         while(array[indexMid] >= array[index2]){
12             if(index2 - index1 ==1){
13                 indexMid = index2;
14                 break;
15             }
16             indexMid = (index1 + index2)/2;
17              
18             
19             if(array[index1] == array[index2]&&array[indexMid] == array[index1])
20                 return MinInOrder(array,index1,index2);
21             if(array[indexMid] >= array[index1])
22                 index1 = indexMid;
23             if(array[indexMid] <= array[index2])
24                 index2 = indexMid;
25             
26         }
27         return array[indexMid];
28         
29     }                                         
30     
31      public int MinInOrder(int[] array,int index1,int index2){
32         int result = array[index1];
33         for(int i = index1 + 1;i<index2;i++){
34             if(result > array[i])
35                 result = array[i];
36         }  
37                 return result;
38     }
39 }