旋转数组的最小数字

import java.util.ArrayList;
public class Solution {
    public int minNumberInRotateArray(int [] array) {
        int low = 0;
        int hight = array.length - 1;
        if(array.length == 0){
            return 0;
        }
        while(low < hight){
            int mid = low + (hight - low) / 2;
            if(array[mid] < array[hight]){
                hight = mid;
            }else if(array[mid] == array[hight]){
                hight--;
            }else{
                low = mid + 1;
            }
        }
        return array[low];
    }
}