#include<iostream>
#include<vector>
#include<stack>
#include<deque>
//双端队列
using namespace std;
int main()
{
deque<int> q;
q.begin(),q.end();
q.front(),q.back();
q.push_back(1);
q.push_front(2);
q.pop_back(),q.pop_front();
q.clear();//清空
return 0;
}