#include "stdafx.h" #include <iostream> #include <list> #include <iterator> #include <algorithm> using namespace std; const int num[5] = {1,3,2,4,5}; bool status(const int & value) {  return value>6?true:false; } int _tmain(int argc, _TCHAR* argv[]) {  list<int> list1;  copy(num,num+5,back_insert_iterator<list<int>>(list1));  copy(list1.begin(),list1.end(),ostream_iterator<int>(cout," "));  cout<<endl;  list1.sort(greater<int>());//5 4 3 2 1  copy(list1.begin(),list1.end(),ostream_iterator<int>(cout," "));  cout<<endl;  list<int>::iterator it = list1.begin();  while (it != list1.end())  {   (*it) += 2;   it++;  }  //7 6 5 4 3  list<int>::reverse_iterator re_it = list1.rbegin();  cout<<"從后向前輸出: ";  while (re_it != list1.rend())  {   cout<<*re_it<<" ";   re_it++;  }  cout<<endl;  list1.reverse();// 3 4 5 6 7  list1.push_back(8);//3 4 5 6 7 8  list1.pop_front();//4 5 6 7 8  list1.remove(6);//4 5 7 8  list1.remove_if(status);// 4 5  list1.resize(4);// 4 5 0 0  list1.resize(6,1);// 4 5 0 0 1 1  list1.unique();//4 5 0 1  copy(list1.begin(),list1.end(),ostream_iterator<int>(cout," "));  cout<<endl;  list1.clear();  cout<<"當前list1含有元素個數："<<list1.size()<<endl;  list1.push_back(7);//list1:7  list<int> list2(3,2);//2 2 2  list2.merge(list1,greater<int>());//list2: 7 2 2 2  list2.insert(++list2.begin(),3);//list2: 7 3 2 2 2  list2.swap(list1);//list1:7 3 2 2 2 list2:empty  list1.erase(++list1.begin(),list1.end());// 7  copy(list1.begin(),list1.end(),ostream_iterator<int>(cout," "));  cout<<endl;  system("pause"); }