【剑指offer】旋转数组的最小数字

public int (int[] array) {
    int left = 0;
    int right = array.length - 1;
    int mid = left;

    while (array[left] >= array[right]){
        if (right - left == 1) {
            mid = right;
            break;
        }

        mid = (left + right) / 2;

        if (array[mid] == array[left] && array[mid] == array[right])
            return minInOrder(array, left, right);
        else if (array[mid] >= array[left])
            left = mid;
        else if (array[mid] <= array[right])
            right = mid;
    }

    return array[mid];
}

private int minInOrder(int[] array, int left, int right){
    int min = array[left];

    for (int i = left + 1; i <= right; i++)
        min = Math.min(min, array[i]);

    return min;
}