Find Minimum in Rotated Sorted Array II

Description

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e.,  [0,1,2,4,5,6,7] might become  [4,5,6,7,0,1,2]).

Find the minimum element.

The array may contain duplicates.

Example 1:

Input: [1,3,5]
Output: 1

Example 2:

Input: [2,2,2,0,1]
Output: 0

Note:

Solution(javascript)


const findMin = (nums = []) => {
  let left = 0
  let right = nums.length - 1
  while (nums[left] === nums[right]) {
    right -= 1
  }
  let pivot = 0
  while (left <= right) {
    const middle = Math.floor((left + right) / 2)
    if (nums[middle] > nums[middle + 1]) {
      pivot = middle + 1
      return nums[pivot]
    }
    if (nums[middle] < nums[middle - 1]) {
      pivot = middle
      return nums[pivot]
    }
    if (nums[middle] >= nums[0]) {
      left = middle + 1
    } else {
      right = middle - 1
    }
  }
  return nums[pivot]
}
← Find Minimum in Rotated Sorted ArrayMin Stack →