Find Minimum in Rotated Sorted Array II

#javascript #leetcode

/**
 * @param {number[]} nums
 * @return {number}
 */
var findMin = function (nums) {
  var left = 0,
    right = nums.length - 1;

  while (left < right) {
    var mid = Math.floor((left + right) / 2);
    if (nums[mid] > nums[right]) {
      left = mid + 1;
    } else if (nums[mid] === nums[right]) {
      right--;
    } else {
      right = mid;
    }
  }
  return nums[left];
};