Medium
Quiz
#153 Find Minimum in Rotated Sorted Array
APPROACH
A sorted array of length n has been rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become:
- [4,5,6,7,0,1,2] after 4 rotations.
- [0,1,2,4,5,6,7] after 7 rotations.
Rotating [a[0], a[1], a[2], ..., a[n-1]] once yields [a[n-1], a[0], a[1], a[2], ..., a[n-2]].
Given the sorted-rotated array nums with unique elements, return its minimum element.
Your algorithm must run in O(log n) time.
Example 1:
Input: nums = [3,4,5,1,2]
Output: 1
Explanation: The original array was [1,2,3,4,5] rotated 3 times.
Example 2:
Input: nums = [4,5,6,7,0,1,2]
Output: 0
Explanation: The original array was [0,1,2,4,5,6,7] and it was rotated 4 times.
Example 3:
Input: nums = [11,13,15,17]
Output: 11
Explanation: The original array was [11,13,15,17] and it was rotated 4 times.
1 of 4
1:00
What is the optimal approach for this problem?