双向队列元素的插入与删除

来源：互联网发布：知否的作者编辑：程序博客网时间：2024/05/21 10:15

#include<iostream>#include<deque>using namespace std;int main(){    deque<int> d;    deque<int>::iterator it;     //定义迭代器    cout << "队头插入元素：" << endl;    d.push_front(1);    d.push_front(2);    d.push_front(3);    for (it = d.begin(); it != d.end(); it++)    {        cout << *it << " ";    }    cout << endl;    cout << "队尾插入元素：" << endl;    d.push_back(98);    d.push_back(99);    d.push_back(100);    for (it = d.begin(); it != d.end(); it++)    {        cout << *it << " ";    }    cout << endl;    cout << "队中间插入元素：" << endl;    d.insert(d.begin() + 3, 50);    for (it = d.begin(); it != d.end(); it++)    {        cout << *it << " ";    }    cout << endl;    cout << "队中间删除元素：" << endl;    d.erase(d.begin() + 3);    for (it = d.begin(); it != d.end(); it++)    {        cout << *it << " ";    }    cout << endl;    cout << "队头删除元素：" << endl;    d.pop_front();    for (it = d.begin(); it != d.end(); it++)    {        cout << *it << " ";    }    cout << endl;    cout << "队尾删除元素：" << endl;    d.pop_back();    for (it = d.begin(); it != d.end(); it++)    {        cout << *it << " ";    }    cout << endl;    return 0;}

运行结果

阅读全文

0 0