图解「剑指Offer」之旋转数组的最小数字

输入: [3，4，5，1，2]
输出: 1

输入: [4，5，6，7，0，1，2]
输出: 0

//author:程序员小吴
class Solution {
    public int findMin(int[] nums) {
        int low = 0, high = nums.length - 1;
        while (low < high) {
            if (nums[low] < nums[high]) return nums[low];
            int mid = low + (high - low) / 2;
            if (nums[mid] > nums[high]){
               low = mid + 1; 
            } else{
               high = mid;
            } 
          }
        return nums[low];
    }
}