153. 寻找旋转排序数组中的最小值（算法200题-80）

var findMin = function (nums) {
    let left = 0,
        right = nums.length - 1,
        center = 0
    while (left < right) {
        center = left + ((right - left) >> 1)
        if (nums[right] < nums[center]) {
            left = center + 1
        } else if (nums[right] > nums[center]) {
            right = center
        }
    }
    return nums[left]
};