STL_stack_queue(非常基础重要）
#include <iostream>#include <list>#include <queue>#include <stack>#include <vector>using namespace std;void queue_list() { queue<int, list<int> > q1; int i; for(i = 0; i < 10; ++i) { q1.push(i); } while(!q1.empty()) { cout << q1.front() << ' ' ; q1.pop(); } cout << endl;}void queue_deque() { queue<int, deque<int> > q2;/// queue<int> q2; int i; for(i = 0; i < 10; ++i) { q2.push(i); } while(!q2.empty()) { cout << q2.front() << ' '; q2.pop(); } cout << endl;}void stack_list() { stack <int, list<int> > s2; int i; for(i = 0; i < 10; ++i) { s2.push(i); } while(!s2.empty()) { cout <<s2.top() << ' '; s2.pop(); } cout << endl;}void stack_vector() { stack <int, vector<int> > s1; ///stack <int> s1; int i; for(i = 0; i < 10; ++i) { s1.push(i); } while(!s1.empty()) { cout << s1.top() << ' '; s1.pop(); } cout << endl;}int main(){ queue_deque(); queue_list(); stack_list(); stack_vector(); return 0;}