Suppose an array sorted in ascending order 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.
The array may contain duplicates.
var findMin = function(nums) {
var start = 0;
var end = nums.length - 1;
while(start < end) {
if(nums[start] < nums[end]) {
return nums[start]
}else{
var mid =parseInt((start + end) / 2);
if(nums[mid] > nums[end]) {
start = mid + 1
}else if(nums[mid] < nums[end]){
end = mid
}else{
end --
}
}
}
return nums[start]
};