• C++提高编程 deque容器


     

     

     

    #include <deque>
    
    void printDeque(const deque<int>& d) 
    {
        for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++) {
            cout << *it << " ";
    
        }
        cout << endl;
    }
    //deque构造
    void test01() {
    
        deque<int> d1; //无参构造函数
        for (int i = 0; i < 10; i++)
        {
            d1.push_back(i);
        }
        printDeque(d1);
        deque<int> d2(d1.begin(),d1.end());
        printDeque(d2);
    
        deque<int>d3(10,100);
        printDeque(d3);
    
        deque<int>d4 = d3;
        printDeque(d4);
    }
    
    int main() {
    
        test01();
    
        system("pause");
    
        return 0;
    }

    #include <deque>
    
    void printDeque(const deque<int>& d) 
    {
        for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++) {
            cout << *it << " ";
    
        }
        cout << endl;
    }
    //赋值操作
    void test01()
    {
        deque<int> d1;
        for (int i = 0; i < 10; i++)
        {
            d1.push_back(i);
        }
        printDeque(d1);
    
        deque<int>d2;
        d2 = d1;
        printDeque(d2);
    
        deque<int>d3;
        d3.assign(d1.begin(), d1.end());
        printDeque(d3);
    
        deque<int>d4;
        d4.assign(10, 100);
        printDeque(d4);
    
    }
    
    int main() {
    
        test01();
    
        system("pause");
    
        return 0;
    }

    #include <deque>
    
    void printDeque(const deque<int>& d) 
    {
        for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++) {
            cout << *it << " ";
    
        }
        cout << endl;
    }
    
    //大小操作
    void test01()
    {
        deque<int> d1;
        for (int i = 0; i < 10; i++)
        {
            d1.push_back(i);
        }
        printDeque(d1);
    
        //判断容器是否为空
        if (d1.empty()) {
            cout << "d1为空!" << endl;
        }
        else {
            cout << "d1不为空!" << endl;
            //统计大小
            cout << "d1的大小为:" << d1.size() << endl;
        }
    
        //重新指定大小
        d1.resize(15, 1);
        printDeque(d1);
    
        d1.resize(5);
        printDeque(d1);
    }
    
    int main() {
    
        test01();
    
        system("pause");
    
        return 0;
    }

     

    C++
    #include <deque>
    
    void printDeque(const deque<int>& d) 
    {
        for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++) {
            cout << *it << " ";
    
        }
        cout << endl;
    }
    //两端操作
    void test01()
    {
        deque<int> d;
        //尾插
        d.push_back(10);
        d.push_back(20);
        //头插
        d.push_front(100);
        d.push_front(200);
    
        printDeque(d);
    
        //尾删
        d.pop_back();
        //头删
        d.pop_front();
        printDeque(d);
    }
    
    //插入
    void test02()
    {
        deque<int> d;
        d.push_back(10);
        d.push_back(20);
        d.push_front(100);
        d.push_front(200);
        printDeque(d);
    
        d.insert(d.begin(), 1000);
        printDeque(d);
    
        d.insert(d.begin(), 2,10000);
        printDeque(d);
    
        deque<int>d2;
        d2.push_back(1);
        d2.push_back(2);
        d2.push_back(3);
    
        d.insert(d.begin(), d2.begin(), d2.end());
        printDeque(d);
    
    }
    
    //删除
    void test03()
    {
        deque<int> d;
        d.push_back(10);
        d.push_back(20);
        d.push_front(100);
        d.push_front(200);
        printDeque(d);
    
        d.erase(d.begin());
        printDeque(d);
    
        d.erase(d.begin(), d.end());
        d.clear();
        printDeque(d);
    }
    
    int main() {
    
        //test01();
    
        //test02();
    
        test03();
        
        system("pause");
    
        return 0;
    }

     

    #include <deque>
    
    void printDeque(const deque<int>& d) 
    {
        for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++) {
            cout << *it << " ";
    
        }
        cout << endl;
    }
    
    //数据存取
    void test01()
    {
    
        deque<int> d;
        d.push_back(10);
        d.push_back(20);
        d.push_front(100);
        d.push_front(200);
    
        for (int i = 0; i < d.size(); i++) {
            cout << d[i] << " ";
        }
        cout << endl;
    
    
        for (int i = 0; i < d.size(); i++) {
            cout << d.at(i) << " ";
        }
        cout << endl;
    
        cout << "front:" << d.front() << endl;
    
        cout << "back:" << d.back() << endl;
    
    }
    
    int main() {
    
        test01();
    
        system("pause");
    
        return 0;
    }

    #include <deque>
    #include <algorithm>
    
    void printDeque(const deque<int>& d) 
    {
        for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++) {
            cout << *it << " ";
    
        }
        cout << endl;
    }
    
    void test01()
    {
    
        deque<int> d;
        d.push_back(10);
        d.push_back(20);
        d.push_front(100);
        d.push_front(200);
    
        printDeque(d);
        sort(d.begin(), d.end());
        printDeque(d);
    
    }
    
    int main() {
    
        test01();
    
        system("pause");
    
        return 0;
    }
  • 相关阅读:
    线性表的顺序存储结构
    Arrays数组类使用介绍
    collection各实现类用途建议
    【转】数据结构collection接口和map接口架构图
    java 面向对象特性说明
    文件的输入输出操作IO
    sql 约束用法
    select into 在mysql中失效的替换办法
    inner join 、left join 、right join 和full join的区别
    Tomcat 启动过程
  • 原文地址:https://www.cnblogs.com/gjianli/p/15337540.html
Copyright © 2020-2023  润新知