[剑指offer] 旋转数组的最小数字

- array[mid] == array[high]: 出现这种情况的array类似 1,0,1,1,1 或者1,1,1,0,1，此时最小数字不好判断在mid左边
 还是右边,这时只好一个一个试
 

array[low] = 4
array[mid] = 4 
array[high] = 6

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