Find Minimum in Rotated Sorted Array
Medium
Topics
A sorted array of unique integers was rotated at some pivot. Given the array nums, return the minimum element in O(log n).
Example 1
Input: nums = [3,4,5,1,2] Output: 1
Example 2
Input: nums = [4,5,6,7,0,1,2] Output: 0
Constraints
- 1 <= nums.length <= 5000
- All integers are unique.
- The array is a rotation of an ascending sort.
Run ⌘' · Submit ⌘⏎
SensAI