题解 | #旋转数组的最小数字 二分法#

import java.util.ArrayList;
public class Solution {
    public int minNumberInRotateArray(int [] array) {
        return process(array, 0, array.length - 1);
    }
    public static int process(int[] array, int left, int right){
        if (left >= right){
            return array[left];
        }
        int mid = (left + right) / 2;
        return Math.min(process(array, left, mid), 
                        process(array, mid + 1, right));
    }
}