#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a[] = {1,2,3,4,5,6,7};
cout<<*max_element(a,a+7)<<endl;
cout<<*min_element(a,a+7)<<endl;
cout<<a[3]<<endl;
return 0;
}
这种方法比较好的是:
不改变原来数据大小的顺序;
向量(vector)中元素求最大值,最小值:
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int a[] = {1,2,3,4,5,6,7};
vector<int> v(a,a+(sizeof(a)/sizeof(int)));
cout<<*max_element(v.begin(),v.end())<<endl;
cout<<*min_element(v.begin(),v.end())<<endl;
cout<<v[2]<<endl;
return 0;
}
同样不会改变容器内部元素的顺序……