154. Find Minimum in Rotated Sorted Array II
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
[0,1,2,4,5,6,7] might become
Find the minimum element.
The array may contain duplicates.
Input: [1,3,5] Output: 1
Input: [2,2,2,0,1] Output: 0
- This is a follow up problem to Find Minimum in Rotated Sorted Array.
- Would allow duplicates affect the run-time complexity? How and why?
Having problems with this solution? Click here to submit an issue on github.