链接:https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array
假设按照升序排序的数组在预先未知的某个点上进行了旋转。例如,数组 [0,1,2,4,5,6,7] 可能变为 [4,5,6,7,0,1,2] 。
请找出其中最小的元素。
var findMin = function(nums) {
let left = 0, right = nums.length - 1;
while(left < right) {
let mid = (left + right) >> 1;
if (nums[mid] > nums[right]) left = mid + 1
else right = mid
}
return nums[left]
};