deque容器是一个双端数组,可以对头端进行插入和删除操作
#include<vector>
#include<deque>
#include<iostream>
using namespace std;
void printDeque(deque<int> &Deque)
{
for (deque<int>::const_iterator it = Deque.begin(); it != Deque.end(); it++)
{
cout << *it << endl;
}
}
int main(void)
{
//几种赋值方法:1,一个一个的赋值 2,容器赋容器 3,assign初始化//deque和vector差不多
deque<int> Deque;
int value = 100;
while (value--)
{
Deque.push_back(value);
}
printDeque(Deque);
deque<int> v2;
v2 = Deque;
deque<int> v3;
v3.assign(v2.begin(),v2.end());
printDeque(v2);
printDeque(v3);
deque<int> v4;
v4.assign(10,100);
printDeque(v4);
int length=v4.size();
cout << length << endl;
v4.empty();
v4.resize(10,10);
//deque插入和删除api
//push_back(elem)
//push_front(elem)
//pop_back(elem)
//pop_front(elem)
//指定位置操作
//insert(pos, elem);
//insert(pos,n,elem);
//insert(pos,beg,end);
//clear();
//erase(beg,end);迭代器的方法
//erase(pos);
v4.push_front(20);
v4.push_front(30);
v4.erase(v4.begin(),v4.end());
deque<int>::const_iterator it = v4.begin();
v4.erase(it++);
//访问deque容器用中括号或则at,有两个方法front()和back()
//排序的方法sort();参数由迭代器实现
return 0;
}