Minimum in a rotated sorted array
Mediumbinary searcharray
nums was sorted ascending without duplicates and then rotated an unknown number of times ([0,1,2,4,5] might become [4,5,0,1,2]). Return the smallest value in O(log n).
Example 1
Input: nums = [3,4,5,1,2] Output: 1
Example 2
Input: nums = [11,13,15,17] Output: 11
Constraints
- 1 ≤ nums.length ≤ 5000
- -5000 ≤ nums[i] ≤ 5000
- Values are distinct
Submit checks your solution against 9 tests, including hidden ones.
/**
* @param {int[]} nums
* @return {int}
*/
function findMin(nums) {
}