C++ //deque容器 构造函数 //deque赋值操作 //deque大小操作 //重新指定大小 //deque没有容量概念 //deque插入和删除 //deque 容器数据存取 ////deque 排序 sotr算法

//deque容器 构造函数  //deque赋值操作   //deque大小操作 //重新指定大小
//deque没有容量概念   //deque插入和删除  //deque 容器数据存取
////deque  排序 sotr算法

#include<iostream>
#include<vector>
#include<deque>
#include<algorithm>

using namespace std;


//打印
void printDeuqe( const deque<int>& d)
{
    for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++)
    {
        //*it = 100;  //容器中的数据不可以修改了
        cout << *it << " ";
    }
    cout << endl;
}
//deque容器 构造函数
void test01()
{
    deque<int>d1;
    for (int i = 0; i < 10; i++)
    {
        d1.push_back(i);
    }
    printDeuqe(d1);

    //将d1的值赋值给d2
    deque<int>d2(d1.begin(), d1.end());
    //deque<int>d2;
    //d2 = d1;
    printDeuqe(d2);

    deque<int>d3(10, 100);
    printDeuqe(d3);

    deque<int>d4(d3);
    printDeuqe(d4);

}
//打印
void printDeque(const deque<int>& d2)
{
    for (deque<int>::const_iterator it = d2.begin(); it != d2.end(); it++)
    {
        cout << *it << " ";
    }
    cout << endl;
}

//deque赋值操作
void test02()
{
    deque<int>d2;
    for (int i = 0; i < 10; i++)
    {
        d2.push_back(i);
    }
    printDeque(d2);

    //operator =等号赋值
    deque<int>d3;
    d3 = d2;
    printDeque(d3);

    //assign 赋值

    deque<int>d4;
    d4.assign(d2.begin(), d2.end());
    printDeque(d4);

    //n个几
    deque<int>d5;
    d5.assign(10, 100);
    printDeque(d5);

}


//打印
void printDeuqe3(const deque<int>& d3)
{
    for (deque<int>::const_iterator it = d3.begin(); it != d3.end(); it++)
    {
        cout << *it << " ";
    }
    cout << endl;
}
//deque大小操作

void test03()
{
    deque<int>d3;
    for (int i = 0; i < 10; i++)
    {
        d3.push_back(i);
    }
    printDeuqe3(d3);

    if (d3.empty())
    {
        cout << "d3为空！！" << endl;
    }
    else
    {
        cout << "d3不为空！！！" << endl;
        cout << "d3的大小为：" << d3.size() << endl;
        //deque没有容量概念

    }
    //重新指定大小
    d3.resize(15, 1);
    //d3.resize(15);
    printDeuqe3(d3);

    d3.resize(6);
    printDeuqe3(d3);

}
//打印
void printDeque4(const deque<int>& d4)
{
    for (deque<int>::const_iterator it = d4.begin(); it != d4.end(); it++)
    {
        cout << *it << " ";
    }
    cout << endl;
}
//插入和删除
//两端操作
void test04()
{
    deque<int>d4;
    //尾插
    d4.push_back(10);
    d4.push_back(20);

    //头插
    d4.push_front(100);
    d4.push_front(200);

    printDeque4(d4); //200 100 10 20


    //尾删
    d4.pop_back();  //200 100 10
    printDeque4(d4);
    //头删
    d4.pop_front(); //100  10
    printDeque4(d4);


}

void test05()
{
    deque<int>d5;
    d5.push_back(10);
    d5.push_back(20);
    d5.push_front(100);
    d5.push_front(200);

    printDeque4(d5); //200 100 10 20

    //insert插入
    d5.insert(d5.begin(), 1000);
    printDeque4(d5);//1000   200  100  10  20

    d5.insert(d5.begin(), 3,10001);
    //10001 10001 10001 1000 200 100 10 20
    printDeque4(d5);


    //按照区间插入
    deque<int>d6;
    d6.push_back(1);
    d6.push_back(2);
    d6.push_back(3);

    d5.insert(d5.begin(), d6.begin(), d6.end());
    //1 2 3 10001 10001 1001 1000 200 100 10 20
    printDeque4(d5);
}
void test07()
{
    deque<int>d7;
    d7.push_back(10);
    d7.push_back(20);
    d7.push_front(100);
    d7.push_front(200);

    //200 100 10 20

    //删除
    deque<int>::iterator it = d7.begin();
    it++;   //第二个数据
    d7.erase(it);
    //200 10 20
    printDeque4(d7);


    //按照区间方式删除
    d7.erase(d7.begin(), d7.end());  //换行符
    printDeque4(d7);
    //清空
    d7.clear();
    printDeque4(d7);

}


//deque 容器数据存取
void test08()
{
    deque<int>d8;
    d8.push_back(10);
    d8.push_back(20);
    d8.push_back(30);

    d8.push_front(100);
    d8.push_front(200);
    d8.push_front(300);

    //300 200 100 10 20 30
    //通过[]方式访问元素
    for (int i = 0; i < d8.size(); i++)
    {
        cout << d8[i] << " ";
    }
    cout << endl;

    //通过at的方式
    for (int i = 0; i < d8.size(); i++)
    {
        cout << d8.at(i) << " ";
    }
    cout << endl;

    cout << "第一个元素为： " << d8.front() << endl;
    cout << "最后一个元素为： " << d8.back() << endl;
}
//打印
void printDeque9(const deque<int>& d9)
{
    for (deque<int>::const_iterator it = d9.begin(); it != d9.end(); it++)
    {
        cout << *it << " ";
    }
    cout << endl;
}

//deque  排序 sotr算法
void test09()
{
    deque<int>d9;
    d9.push_back(10);
    d9.push_back(20);
    d9.push_back(30);

    d9.push_front(100);
    d9.push_front(200);
    d9.push_front(300);
    //300 200 100 10 20 30 
    printDeque9(d9);

    //排序  从小到大 升序
    //对于支持随机访问迭代器的容器，都可以利用sort算法直接对其进行排序
    //vector容器也可以利用 sort 进行排序
    sort(d9.begin(), d9.end());
    cout << "排序后的结果：" << endl;
    printDeque9(d9);



}

int main()
{
    test01();
    test02();

     test03();

    test04();

    test05();

    test07();

    test08();

    test09();
    system("pause");
    return 0;
}