Follow up for "Find Minimum in Rotated Sorted Array":
What if duplicates are allowed?Would this affect the run-time complexity? How and why?
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.
The array may contain duplicates.
跟前一个问题的解法一模一样,完全不会影响时间复杂度,代码如下:
class Solution {
public:
int findMin(vector<int> &num) {
int minimun=num[0];
vector<int>::iterator it;
for(it=num.begin();it!=num.end();it++)
{
if(*it<=minimun) minimun=*it;
}
return minimun;
}
};