Find Minimum in Rotated Sorted Array
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. [#153]
(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.
Examples: Input: [3,4,5,1,2] Output: 1 Input: [4,5,6,7,0,1,2] Output: 0
Find Minimum in Rotated Sorted Array II
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. [#154]
(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2] ).
Find the minimum element.
The array may contain duplicates.
Examples: Input: [1,3,5] Output: 1 Input: [2,2,2,0,1] Output: 0