class Solution {
public:
int minArray(vector<int>& numbers) {
int res=INT_MAX;
for(int i=0;i<numbers.size();i++){
if(numbers[i]<res)
res=numbers[i];
}
return res;
}
};
二分法
**class Solution {
public:
int minArray(vector<int>& numbers) {
int l=0,r=numbers.size()-1;
while(l<r){
int mid=(l+r)/2;
if(numbers[mid]<numbers[r])
r=mid;
else if(numbers[mid]>numbers[r])
l=mid+1;
else r--;
}
return numbers[l];
}
};**