剑指offer 6.旋转数组的最小数字

import java.util.ArrayList;
public class Solution {
    public int minNumberInRotateArray(int [] array) {
        // 从头到尾扫描，记录前一个值大于后一个值的位置
        if(array.length <= 0)
            return 0;
        
        for(int j = 0; j < array.length - 1; j++){
            if(array[j + 1] < array[j]){
                return array[j + 1];
            }
        }
        return 0;
    }
}

 1 import java.util.ArrayList;
 2 public class Solution {
 3     public int minNumberInRotateArray(int [] array) {
 4         // 从头到尾扫描，记录前一个值大于后一个值的位置
 5         if(array.length <= 0)
 6             return 0;
 7         // 变形的二分查找
 8         int low = 0, high = array.length - 1;
 9         int mid;
10         while(low < high){
11             mid = (high - low) / 2 + low;
12             if(array[low] < array[high])
13                 return array[low];
14             if(array[mid] > array[low]){
15                 low = mid + 1;
16             }else if(array[mid] < array[high]){
17                 high = mid;
18             }else{
19                 low++;
20             }
21         }
22        return array[low];
23     }
24 }