LeetCode 153&154 Find Minimum in Rotated Sorted Array

问题：

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.

You may assume no duplicate exists in the array.

解答

旋转后的数组是先递增，然后再递增

start=0，end=size-1，mid=(start+end)/2

如果nums[mid]

class Solution {
public:
int findMin(vector<int>& nums) {
int pos=0;
for(int i=1;i<nums.size()-1;i++){
if(nums[i]<nums[i-1]&&nums[i]<nums[i+1]){
pos=i;
}
}
if(nums[pos]>nums[0])
pos=0;
if(nums[pos]>nums[nums.size()-1]){
pos=nums.size()-1;
}
return nums[pos];

}
};

# 问题

Follow up for “Find Minimum in Rotated Sorted Array”。What if duplicates are allowed?Would this affect the run-time complexity? How and why?