#include <iostream>
#include <list>
#include <numeric>
#include <algorithm>

using namespace std;

//創(chuàng)建一個(gè)list容器的實(shí)例LISTINT
typedef list<int> LISTINT;

//創(chuàng)建一個(gè)list容器的實(shí)例LISTCHAR
typedef list<int> LISTCHAR;

void main(void)
{
    //--------------------------
    //用list容器處理整型數(shù)據(jù)
    //--------------------------
    //用LISTINT創(chuàng)建一個(gè)名為listOne的list對(duì)象
    LISTINT listOne;
    //聲明i為迭代器
    LISTINT::iterator i;

    //從前面向listOne容器中添加數(shù)據(jù)
    listOne.push_front (2);
    listOne.push_front (1);

    //從后面向listOne容器中添加數(shù)據(jù)
    listOne.push_back (3);
    listOne.push_back (4);

    //從前向后顯示listOne中的數(shù)據(jù)
    cout<<"listOne.begin()--- listOne.end():"<<endl;
    for (i = listOne.begin(); i != listOne.end(); ++i)
        cout << *i << " ";
    cout << endl;

    //從后向后顯示listOne中的數(shù)據(jù)
LISTINT::reverse_iterator ir;
    cout<<"listOne.rbegin()---listOne.rend():"<<endl;
    for (ir =listOne.rbegin(); ir!=listOne.rend();ir++) {
        cout << *ir << " ";
    }
    cout << endl;

    //使用STL的accumulate(累加)算法
    int result = accumulate(listOne.begin(), listOne.end(),0);
    cout<<"Sum="<<result<<endl;
    cout<<"------------------"<<endl;

    //--------------------------
    //用list容器處理字符型數(shù)據(jù)
    //--------------------------

    //用LISTCHAR創(chuàng)建一個(gè)名為listOne的list對(duì)象
    LISTCHAR listTwo;
    //聲明i為迭代器
    LISTCHAR::iterator j;

    //從前面向listTwo容器中添加數(shù)據(jù)
    listTwo.push_front ('A');
    listTwo.push_front ('B');

    //從后面向listTwo容器中添加數(shù)據(jù)
    listTwo.push_back ('x');
    listTwo.push_back ('y');

    //從前向后顯示listTwo中的數(shù)據(jù)
    cout<<"listTwo.begin()---listTwo.end():"<<endl;
    for (j = listTwo.begin(); j != listTwo.end(); ++j)
        cout << char(*j) << " ";
    cout << endl;

    //使用STL的max_element算法求listTwo中的最大元素并顯示
    j=max_element(listTwo.begin(),listTwo.end());
    cout << "The maximum element in listTwo is: "<<char(*j)<<endl;
}