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

function findMin(nums: number[]): number {
  let left = 0
  let right = nums.length - 1

  while (left < right) {
    // 找到中间点 index
    const mid = left + ((right - left) >> 1)

    // 二分
    if (nums[mid] < nums[right]) right = mid
    else if (nums[mid] > nums[right]) left = mid + 1
  }

  return nums[left]
}

function findMin(nums: number[]): number {
  let left = 0
  let right = nums.length - 1

  while (left < right) {
    // 找到中间点 index
    const mid = left + ((right - left) >> 1)

    // 二分
    if (nums[mid] < nums[right]) right = mid
    else if (nums[mid] > nums[right]) left = mid + 1
  }

  return nums[left]
}