#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int a[5]={1,2,3,0,-20};
cout<<*max_element(a,a+5)<<endl;
cout<<*max_element(a,a+5)<<endl;
return 0;
}

也可以通過這種方式，修改最大值或最小值

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int a[5]={1,2,3,0,-2},m=10;
*min_element(a,a+5) += *max_element(a,a+5);//把最小元素和最大元素的和 賦給當(dāng)前最小元素
cout<<*max_element(a,a+5);
return 0;
}

c++中min和max函數(shù)

包含在c++標(biāo)準(zhǔn)庫中頭文件<algorithm>中，在頭文件<windows.h>中定義了min,max的宏，若在包含<algorithm>的同時(shí)包含<windows.h>會(huì)導(dǎo)致函數(shù)無法使用。

<windows.h>提供了_cpp_min等函數(shù)來代替min函數(shù)的功能。

C++11標(biāo)準(zhǔn)：<algorithm>中min函數(shù)的原型

default (1)	template <class T> const T& min (const T& a, const T& b);
custom (2)	template <class T, class Compare> const T& min (const T& a, const T& b, Compare comp);
initializer list (3)	template <class T> T min (initializer_list<T> il); template <class T, class Compare> T min (initializer_list<T> il, Compare comp);

Return the smallest

Returns the smallest of a and b. If both are equivalent, a is returned.

The versions for initializer lists (3) return the smallest of all the elements in the list. Returning the first of them if these are more than one.

The function uses operator< (or comp, if provided) to compare the values.

eg:custom2<pre style="margin-top: 0px; margin-bottom: 0px; color: rgb(0, 128, 0);">template <class T, class Compare>
? const T& min (const T& a, const T& b, Compare comp);

#include<iostream>
#include<algorithm>
using namespace std;
struct var {
?? ?char *name;
?? ?int key;
?? ?var(char *a,int k):name(a),key(k){}
};
bool comp(const var& l, const var& r) {
?? ?return l.key < r.key;
}
int main() {
?? ?var v1("var1", 2);
?? ?var v2("var2", 3);
?? ?cout << std::min(v1, v2,comp).name << endl;
?? ?return 0;
}

stable_sort,max函數(shù)同min

以上為個(gè)人經(jīng)驗(yàn)，希望能給大家一個(gè)參考，也希望大家多多支持腳本之家。

您可能感興趣的文章: