区间find(查找)和revers(反转)

#include <algorithm>
#include <list>
#include <iostream>
using namespace std;

int main()
{
    list<int> coll;

    // insert elements from 20 to 40
    for (int i = 20; i <= 40; ++i) {
        coll.push_back(i);
    }
    //list<int>::iterator can use auto instead
    list<int>::iterator pos3 = find(coll.begin(), coll.end(),    // range
        3);                          // value
    //没有变换
    reverse(pos3, coll.end());

    // find positions of values 25 and 35
    list<int>::iterator pos25, pos35;
    pos25 = find(coll.begin(), coll.end(),  // range
        25);                       // value
    pos35 = find(coll.begin(), coll.end(),  // range
        35);                       // value

    reverse(pos25, pos35);//区间反转
    cout << "max: " << *max_element(pos25, pos35) << endl;

    // process the elements including the last position
    cout << "max: " << *max_element(pos25, ++pos35) << endl;
}