双向链表容器list的头尾中，全部删除

#include <iostream>
#include <list>
using namespace std;


int main()
{
list<int> l;
for (size_t i=1; i < 11; ++i)
{
l.push_back(i);
}


list<int>::iterator it;
for(it=l.begin(); it != l.end(); ++it)
{
cout << *it << " ";
}
cout <<endl;


//用 remove()函数删除一个元素，值相同的都会被删除；
l.remove(4);

for(it=l.begin(); it != l.end(); ++it)
{
cout << *it << " ";
}
cout <<endl;


//用pop_front()函数删除首元素
l.pop_front();

for(it=l.begin(); it != l.end(); ++it)
{
cout << *it << " ";
}
cout <<endl;

//用pop_back()函数删除尾元素；
l.pop_back();



for(it=l.begin(); it != l.end(); ++it)
{
cout << *it << " ";
}
cout <<endl;
//用earse()函数删除指定地方的元素
it=l.begin();
it++;
l.erase(it);

for(it=l.begin(); it != l.end(); ++it)
{
cout << *it << " ";
}
cout <<endl;


//用clear()函数删除所有的元素；
l.clear();
cout << l.size()<<endl;

cin.get();
return 0;
}