153.寻找旋转排序数组中的最小值

中位数直接取值就完事

class Solution {
    public int findMin(int[] nums) {
        int low = 0,high = nums.length - 1;
        while (low < high) {
            int mid = (low + high)>>1;
            if (nums[mid] < nums[high]) {
                high = mid;
            }else {
                low = mid + 1;
            }
        }
        return nums[low];
    }
}