deque

#include<bits/stdc++.h>
using namespace std;
int main()
{
	//deque double -end
	
	deque<int > v1;
	deque<int >v2(100);
	deque<int >v3(100,8);
	deque<int >v4(v3);
	int ary[]={1,2,4,3,5};
	deque<int> v5(ary+2,ary+4);// 4 3;
	for(int i=0;i<v5.size();i++)
	{
		printf("%d ",v5[i]);	
	} 
	cout<<endl;
	v3.insert(v3.begin(),1);//在头部插入1； 
	v3.pop_front();//删除头部元素 
	for(int i=0;i<v3.size();i++)
	{
		printf("%d ",v3[i]);	
	}		
	cout<<endl;
	v2.insert(v2.begin()+1,ary+2,ary+4);//以数组的形式插入
	v2.push_front(33);//在头部添加 
	for(int i=0;i<v2.size();i++)
	{
		printf("%d ",v2[i]);	
	}
	cout<<endl;
	v2.erase(v2.begin(),v2.begin()+2);//删除 
	 for(int i=0;i<v2.size();i++)
	{
		printf("%d ",v2[i]);	
	}
	cout<<endl;
	deque<int >::iterator it=v3.begin();//while 
	while(it!=v3.end())
	{
		printf("%d ",*it++);
			
	}	
	cout<<endl;
}