tags: Array, Binary Search
#LeetCode 153 Find Minimum in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
Find the minimum element.
You may assume no duplicate exists in the array.
Diffculty
Medium
Similar Problems
[LeetCode 33] Search in Rotated Sorted Array Medium
[LeetCode 154] Find Minimum in Rotated Sorted Array II Medium