#include <iostream>  #include <list>  #include <numeric>  #include <algorithm>   using namespace std;     typedef list<int> LISTINT;  //創(chuàng)建一個(gè)list容器的實(shí)例LISTINT typedef list<int> LISTCHAR; //創(chuàng)建一個(gè)list容器的實(shí)例LISTCHAR int main(void) {      LISTINT listOne;  //用LISTINT創(chuàng)建一個(gè)名為listOne的list對(duì)象     LISTINT::iterator i;  //聲明i為迭代器       listOne.push_front (2); //從前面向listOne容器中添加數(shù)據(jù)   listOne.push_front (1);     listOne.push_back (3); //從后面向listOne容器中添加數(shù)據(jù)   listOne.push_back (4);          cout<<"listOne.begin()--- listOne.end():"<<endl;  //從前向后顯示listOne中的數(shù)據(jù)   for (i = listOne.begin(); i != listOne.end(); ++i)         cout << *i << " ";     cout << endl;              LISTINT::reverse_iterator ir;  //從后向后顯示listOne中的數(shù)據(jù)   cout<<"listOne.rbegin()---listOne.rend():"<<endl;    for (ir =listOne.rbegin(); ir!=listOne.rend();ir++)          cout << *ir << " ";         cout << endl;           int result = accumulate(listOne.begin(), listOne.end(),0); //使用STL的accumulate(累加)算法      cout<<"Sum="<<result<<endl;       LISTCHAR listTwo;  //用LISTCHAR創(chuàng)建一個(gè)名為listOne的list對(duì)象    LISTCHAR::iterator j;   //聲明j為迭代器      listTwo.push_front ('A'); //從前面向listTwo容器中添加數(shù)據(jù)     listTwo.push_front ('B');      listTwo.push_back ('x');  //從后面向listTwo容器中添加數(shù)據(jù)    listTwo.push_back ('y');       cout<<"listTwo.begin()---listTwo.end():"<<endl; //從前向后顯示listTwo中的數(shù)據(jù)   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;   return 0; }    

 [work@db-testing-com06-vm3.db01.baidu.com c++]$ g++ -o list list.cpp [work@db-testing-com06-vm3.db01.baidu.com c++]$ ./list listOne.begin()--- listOne.end():1 2 3 4 listOne.rbegin()---listOne.rend():4 3 2 1 Sum=10listTwo.begin()---listTwo.end():B A x y The maximum element in listTwo is: y