100. Minimum in a Rotated Sorted Array
MediumSearching
An ascending array of distinct numbers has been rotated at an unknown point (for example [0, 1, 2, 4, 5] might become [4, 5, 0, 1, 2]). Return its smallest element in O(log n) time.
Example 1
Input: nums = [3, 4, 5, 1, 2] Output: 1
Constraints
1 ≤ nums.length ≤ 5000Values are distinct