for(list<int>::const_iteratoriter = lst1.begin();iter != lst1.end();iter++) 
 { 
  cout<<*iter; 
 } 
 cout<<endl; 

#include <iostream> 
#include <list> 
#include <numeric> 
#include <algorithm> 
#include <windows.h> 
using namespace std; 
  
typedef list<int> LISTINT; 
typedef list<int> LISTCHAR; 
  
void main() 
{ 
  //用LISTINT創(chuàng)建一個list對象 
  LISTINT listOne; 
  //聲明i為迭代器 
  LISTINT::iterator i; 
  
  listOne.push_front(3); 
  listOne.push_front(2); 
  listOne.push_front(1); 
  
  listOne.push_back(4); 
  listOne.push_back(5); 
  listOne.push_back(6); 
  
  cout << "listOne.begin()--- listOne.end():" << endl; 
  for (i = listOne.begin(); i != listOne.end(); ++i) 
    cout << *i << " "; 
  cout << endl; 
  
  LISTINT::reverse_iterator ir; 
  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); 
  cout << "Sum=" << result << endl; 
  cout << "------------------" << endl; 
  
  //用LISTCHAR創(chuàng)建一個list對象 
  LISTCHAR listTwo; 
  //聲明i為迭代器 
  LISTCHAR::iterator j; 
  
  listTwo.push_front('C'); 
  listTwo.push_front('B'); 
  listTwo.push_front('A'); 
  
  listTwo.push_back('D'); 
  listTwo.push_back('E'); 
  listTwo.push_back('F'); 
  
  cout << "listTwo.begin()---listTwo.end():" << endl; 
  for (j = listTwo.begin(); j != listTwo.end(); ++j) 
    cout << char(*j) << " "; 
  cout << endl; 
  
  j = max_element(listTwo.begin(), listTwo.end()); 
  cout << "The maximum element in listTwo is: " << char(*j) << endl; 
  Sleep(10000); 
} 
  

#include <iostream>  
#include <list>  
#include <windows.h> 
 
using namespace std; 
typedef list<int> INTLIST; 
 
//從前向后顯示list隊列的全部元素  
void put_list(INTLIST list, char *name) 
{ 
  INTLIST::iterator plist; 
 
  cout << "The contents of " << name << " : "; 
  for (plist = list.begin(); plist != list.end(); plist++) 
    cout << *plist << " "; 
  cout << endl; 
} 
 
//測試list容器的功能  
void main(void) 
{ 
  //list1對象初始為空  
  INTLIST list1; 
  INTLIST list2(5, 1); 
  INTLIST list3(list2.begin(), --list2.end()); 
 
  //聲明一個名為i的雙向迭代器  
  INTLIST::iterator i; 
 
  put_list(list1, "list1"); 
  put_list(list2, "list2"); 
  put_list(list3, "list3"); 
 
  list1.push_back(7); 
  list1.push_back(8); 
  cout << "list1.push_back(7) and list1.push_back(8):" << endl; 
  put_list(list1, "list1"); 
 
  list1.push_front(6); 
  list1.push_front(5); 
  cout << "list1.push_front(6) and list1.push_front(5):" << endl; 
  put_list(list1, "list1"); 
 
  list1.insert(++list1.begin(), 3, 9); 
  cout << "list1.insert(list1.begin()+1,3,9):" << endl; 
  put_list(list1, "list1"); 
 
  //測試引用類函數(shù)  
  cout << "list1.front()=" << list1.front() << endl; 
  cout << "list1.back()=" << list1.back() << endl; 
 
  list1.pop_front(); 
  list1.pop_back(); 
  cout << "list1.pop_front() and list1.pop_back():" << endl; 
  put_list(list1, "list1"); 
 
  list1.erase(++list1.begin()); 
  cout << "list1.erase(++list1.begin()):" << endl; 
  put_list(list1, "list1"); 
 
  list2.assign(8, 1); 
  cout << "list2.assign(8,1):" << endl; 
  put_list(list2, "list2"); 
 
  cout << "list1.max_size(): " << list1.max_size() << endl; 
  cout << "list1.size(): " << list1.size() << endl; 
  cout << "list1.empty(): " << list1.empty() << endl; 
 
  put_list(list1, "list1"); 
  put_list(list3, "list3"); 
  cout << "list1>list3: " << (list1 > list3) << endl; 
  cout << "list1<list3: " << (list1 < list3) << endl; 
 
  list1.sort(); 
  put_list(list1, "list1"); 
 
  list1.splice(++list1.begin(), list3); 
  put_list(list1, "list1"); 
  put_list(list3, "list3"); 
  Sleep(10000); 
}