数组的最小数字

Question

相当于一个有序数组的移动

import java.util.ArrayList;
public class Solution {
    public int minNumberInRotateArray(int [] array) {
        if (array.length == 0){
            return 0;
        }
        int left = 0;
        int right = array.length - 1;
        int middle = 0;
        while (array[left] >= array[right]){
            middle = (left + right ) / 2;
            if (right - left == 1){
                middle = right;
                break;
            }
            if (array[middle] >= array[left]){
                left = middle;
            } else {
                right = middle;
            }
        }
        return array[middle];
    }
}