deque:双端队列容器(队头队尾都可入,出)底层数据结构情况动态开辟的二维数组,一维数组从2开始,以2倍方式进行扩容,每次扩容后,原来第二维数组从新的第一维数组的下标oldsize/2开始存储如下列图序满了扩容,扩容第1维,2倍扩dequedeq;增加:deq.push_back(20)；从尾部添加,可能引起扩容O(1)deq.push_font(20);从头部添加,O(1)deq.insert(iterator,20);从迭代器指向的位置加入元素O(N)删除:deq.pop_back();//从尾部删除元素O(1);deq.pop_front();//从头部删除元素O(1);deq.era

C++进阶-3-3deque容器1#include2#include3#include4usingnamespacestd;56//deque容器78voidprintDeque(dequeint>&d){9for(dequeint>::iteratorit=d.begin();it!=d.end();it++){10cout"";11}12coutendl;1314}1516//1.构造函数17voidtest01(){1819dequeint>d1;20for(inti=0;i10;i++){21d1.push_back(i);22}23printDeque(d1);2425dequein

C++进阶-3-3deque容器1#include2#include3#include4usingnamespacestd;56//deque容器78voidprintDeque(dequeint>&d){9for(dequeint>::iteratorit=d.begin();it!=d.end();it++){10cout"";11}12coutendl;1314}1516//1.构造函数17voidtest01(){1819dequeint>d1;20for(inti=0;i10;i++){21d1.push_back(i);22}23printDeque(d1);2425dequein