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.
假设一个有序数组从某一个你不知道的位置开始被反转,返回数组的最小元素。
代码如下:
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;
}
};