#include<list>

//構(gòu)造打印練習(xí)
void TestList()
{
    list<int>L1;
    //十個(gè)值為5
    list<int>L2(10,5);
 
    //區(qū)間方式構(gòu)造
    vector<int>v{ 0,3,35,34,2 };
    list<int>L3(v.begin(),v.end());
 
    //拷貝構(gòu)造
    list<int>L4(L3);
 
    //列表構(gòu)造
    list<int>L5{ 1,23,34 };
 
    //打印，范圍for
    for (auto e:L2)
    {
        cout << e << " ";
    }
    cout << endl;
 
    //迭代器打印
    auto it = L3.begin();
    while (it != L3.end())
    {
        cout << *it << " ";
        ++it;
    }
    cout << endl;
}

void TestList()
{
    list<int>L;
    L.push_back(1);
    L.push_back(2);
    L.push_back(3);
    L.push_back(4);
    L.push_back(5);
 
    cout << L.size() << endl;
    cout << L.front() << endl;//訪問(wèn)起始位置
    cout << L.back() << endl;//訪問(wèn)末尾
 
    L.front() = 50;
    L.back() = 1000;
 
    L.pop_back();//刪除list中最后一個(gè)元素
 
    cout << L.size() << endl;
    cout << L.front() << endl;
    cout << L.back() << endl;
}

void TestList()
{
    list<int>L;
    L.push_back(1);
    L.push_back(2);
    L.push_back(3);
    L.push_back(4);
    L.push_back(5);
    PrintList(L);
 
    auto pos = L.begin();
    L.insert(pos, 0);//在1的位置插入0，插入之前
    PrintList(L);
 
    cout << *pos << endl;//查看迭代器是否正常使用
    
    //在鏈表中值為data的節(jié)點(diǎn)前插入10個(gè)值為2的元素
    int data = 0;
    cin >> data;
    
    //在這個(gè)區(qū)間內(nèi)找data，返回pos。如果沒(méi)找到返回end
    pos= find(L.begin(),L.end(),data);
 
    if (pos != L.end())
    {
        L.insert(pos, 10, 2);
    }
    PrintList(L);
 
    //區(qū)間形式
    pos = L.begin();
    vector<int>v{ 10,20,34,34,1244 };
    L.insert(pos, v.begin(), v.end());
    PrintList(L);
}

void TestList()
{
    list<int>L;
    L.push_back(1);
    L.push_back(2);
    L.push_back(3);
    L.push_back(4);
    L.push_back(5);
    PrintList(L);
 
    auto pos1 = L.begin();
    auto pos2 = find(L.begin(),L.end(),5);
    cout << *pos2 << endl;
 
    L.erase(pos1);//將pos1位置處元素刪除
    PrintList(L);
 
    cout << *pos2 << endl;//檢測(cè)迭代器是否失效
    cout << *pos1 << endl;
    //結(jié)果是pos2正常,pos1失效
}