deque================>双端队列
#include<iostream>
#include<queue>
using namespace std;
int main() {
//双端队列,两端都可以出入
/*先入先出,后入后出*/
deque<int> q;
for (int i = 0; i < 5; i++) {
q.push_back(i);//后面来
}
while (!q.empty()) {
cout << q .front()<< " ";
q.pop_front();//前面走
}
cout << "\n=================" << endl;
/*随便进入*/
q.push_back(1);//1
q.push_front(2);//1 2
q.push_back(3);//3 1 2
q.pop_back();//1 2
q.pop_front();//1
while (!q.empty()) {
cout << q.front() << " ";
q.pop_front();//前面走
}
return 0;
}
deque的 [ ] 和 at( ) 也能用.