push_back(x)/push_front(x) //把x压入后/前端 back()/front() //访问(不删除)后/前端元素 pop_back() pop_front() //删除后/前端元素 empty() //判断deque是否空 size() //返回deque的元素数量 clear() //清空deque 支持通过sort(d.begin(),d.end())进行排序。 运用实例
#include<bits/stdc++.h> using namespace std; deque<int> d; int main() { int n,m; cin >> n >> m; int flag,x; while(m--) { cin >> flag; switch(flag) { case 1: cin >> x;d.push_front(x);break; case 2: d.pop_front();break; case 3: cin >> x;d.push_back(x);break; case 4: d.pop_back();break; case 5: reverse(d.begin(),d.end());break; case 6: cout << d.size() << endl; for(int i = 0;i < d.size() - 1;i++) cout << d[i] << " "; cout << d[d.size() - 1] << endl;break; default: sort(d.begin(),d.end());break; } } return 0; }