Source:

<br /> #include <iostream><br /> #include <list><br /> #include <numeric><br /> #include <algorithm><br /> using namespace std; </p> <p>typedef list<int> LISTINT; //创建一个list容器的实例LISTINT<br /> typedef list<int> LISTCHAR; //创建一个list容器的实例LISTCHAR<br /> int main(void) {<br /> LISTINT listOne; //用LISTINT创建一个名为listOne的list对象<br /> LISTINT::iterator i; //声明i为迭代器<br /> listOne.push_front (2); //从前面向listOne容器中添加数据<br /> listOne.push_front (1);<br /> listOne.push_back (3); //从后面向listOne容器中添加数据<br /> listOne.push_back (4); </p> <p> cout<<"listOne.begin()--- listOne.end():"<<endl; //从前向后显示listOne中的数据<br /> for (i = listOne.begin(); i != listOne.end(); ++i)<br /> cout << *i << " ";<br /> cout << endl; </p> <p> LISTINT::reverse_iterator ir; //从后向后显示listOne中的数据<br /> cout<<"listOne.rbegin()---listOne.rend():"<<endl;<br /> for (ir =listOne.rbegin(); ir!=listOne.rend();ir++)<br /> cout << *ir << " ";<br /> cout << endl; </p> <p> int result = accumulate(listOne.begin(), listOne.end(),0); //使用STL的accumulate(累加)算法<br /> cout<<"Sum="<<result<<endl; </p> <p> LISTCHAR listTwo; //用LISTCHAR创建一个名为listOne的list对象<br /> LISTCHAR::iterator j; //声明j为迭代器<br /> listTwo.push_front ('A'); //从前面向listTwo容器中添加数据<br /> listTwo.push_front ('B');<br /> listTwo.push_back ('x'); //从后面向listTwo容器中添加数据<br /> listTwo.push_back ('y');<br /> cout<<"listTwo.begin()---listTwo.end():"<<endl; //从前向后显示listTwo中的数据<br /> for (j = listTwo.begin(); j != listTwo.end(); ++j)<br /> cout << char(*j) << " ";<br /> cout << endl;<br /> //使用STL的max_element算法求listTwo中的最大元素并显示<br /> j=max_element(listTwo.begin(),listTwo.end());<br /> cout << "The maximum element in listTwo is: "<<char(*j)<<endl;<br /> return 0;<br /> }<br />

Result:

[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=10

listTwo.begin()---listTwo.end():

B A x y

The maximum element in listTwo is: y