Minimum in Rotated Sorted Array
MediumP1Coding
A sorted array of distinct integers was rotated at an unknown pivot, for example [0,1,2,4,5,6,7] became [4,5,6,7,0,1,2]. Given the rotated array nums, return its minimum element in O(log n). The array may also be not rotated at all.
Example 1
- Input
- nums = [3,4,5,1,2]
- Output
- 1
Example 2
- Input
- nums = [4,5,6,7,0,1,2]
- Output
- 0
Example 3
- Input
- nums = [11,13,15,17]
- Output
- 11
- Why
- Not rotated: the first element is the minimum.
Constraints
- 1 <= nums.length <= 5000
- -5000 <= nums[i] <= 5000
- All values are distinct.
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 8. ⌘Enter runs, ⌘⇧Enter submits.