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

/*
 * @lc app=leetcode.cn id=153 lang=javascript
 *
 * [153] 寻找旋转排序数组中的最小值
 */

// @lc code=start
/**
 * @param {number[]} nums
 * @return {number}
 */
var findMin = function(nums) {
  let left = 0;
  let right = nums.length - 1;
  let mid = 0;
  while (left < right) {
    if (nums[left] < nums[right]) {
      return nums[left];
    }
    mid = parseInt((left + right) / 2);
    if (nums[mid] < nums[right]) {
      right = mid;
    } else {
      left = mid + 1;
    }
  }
  return nums[right];
};
// @lc code=end