STL_算法_最小值和最大值(min_element、max_element)

C++ Primer 学习中。。。

 

简单记录下我的学习过程 (代码为主)


min_element、max_element  找最小、最大值。 很简单没什么大作用



#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

/*******************************************************************************************
template <class ForwardIterator>
ForwardIterator min_element ( ForwardIterator first, ForwardIterator last );

template <class ForwardIterator, class Compare>
ForwardIterator min_element ( ForwardIterator first, ForwardIterator last,
                              Compare comp );

eg:
template <class ForwardIterator>
ForwardIterator min_element ( ForwardIterator first, ForwardIterator last )
{
    ForwardIterator lowest = first;
    if (first==last) return last;
    while (++first!=last)
        if (*first<*lowest)    // or: if (comp(*first,*lowest)) for the comp version
            lowest=first;
    return lowest;
}
********************************************************************************************/

/********************************************************************************************
template <class ForwardIterator>
ForwardIterator max_element ( ForwardIterator first, ForwardIterator last );

template <class ForwardIterator, class Compare>
ForwardIterator max_element ( ForwardIterator first, ForwardIterator last,
                              Compare comp );
eg:
template <class ForwardIterator>
ForwardIterator max_element ( ForwardIterator first, ForwardIterator last )
{
    ForwardIterator largest = first;
    if (first==last) return last;
    while (++first!=last)
        if (*largest<*first)    // or: if (comp(*largest,*first)) for the comp version
            largest=first;
    return largest;
}
********************************************************************************************/

bool myfn(int i, int j)
{
    return i<j;
}

struct myclass
{
    bool operator() (int i,int j)
    {
        return i<j;
    }
} myobj;

int main ()
{
    int myints[] = {3,7,2,5,6,4,9};

    // using default comparison:
    cout << "The smallest element is " << *min_element(myints,myints+7) << endl;
    cout << "The largest element is " << *max_element(myints,myints+7) << endl;

    // using function myfn as comp:                                    函数
    cout << "The smallest element is " << *min_element(myints,myints+7,myfn) << endl;
    cout << "The largest element is " << *max_element(myints,myints+7,myfn) << endl;

    // using object myobj as comp:                                     函数对象
    cout << "The smallest element is " << *min_element(myints,myints+7,myobj) << endl;
    cout << "The largest element is " << *max_element(myints,myints+7,myobj) << endl;

    return 0;
}

/*********
Output:
The smallest element is 2
The largest element is 9
The smallest element is 2
The largest element is 9
The smallest element is 2
The largest element is 9
*********/


  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值