c++ list数据结构及双链表

list的应用

要了解c++的list实现细节可以参考C++链表的C实现（链表反转、合并）

#include 
#include 
#include 

using namespace std;
int main()
{
   
    list<int> mylist{
   1,2,3,4,5};
    mylist.push_back(10);
    for(auto i : mylist){
   
        cout<<i<<endl;
    }
    cout<<endl;

    mylist.assign(3,5);//重新初始化链表为3个5
    for(auto i : mylist){
   
        cout<<i<<endl;
    }
    cout<<endl;
    
    mylist.assign(5,3);//重新初始化链表为5个3
    mylist.push_front(9);
    for(auto ib = mylist.begin(), ie = mylist.end();ib!=ie;ib++){
   //正序
        cout<<*ib<<endl;
    }
    cout<<endl;
    
    for(auto rb = mylist.rbegin(), re = mylist.rend();rb!=re;rb++){
   //倒序
        cout<<*rb<<endl;
    }
    cout<<"第一个L:"<<mylist.front()<<endl;
    cout<<"最后一个:"<<mylist.back()<<endl;
    cout<<"个数："<<mylist.size()<<endl;
    mylist.clear();
    cout<<endl;
    
    
    int a[10] {
   1,2,3,4<