数据结构-用双端队列实现栈

#include<iostream> #include<algorithm> #include<deque> #include"d_random.h" #include"deque_stack.h" using namespace std; int main() { Stack<int> sk; randomNumber rnd; for(int i=0;i<15;i++){ sk.push(rnd.random()%100); } cout<<"原来的栈："<<endl; sk.display(cout); cout<<"奇数栈的顶端："<<sk.getTop1()<<endl; cout<<"偶数栈的顶端："<<sk.getTop2()<<endl; cout<<endl; sk.pop1(); cout<<"去掉栈顶元素后奇数栈的顶端："<<sk.getTop1()<<endl; sk.pop2(); cout<<"去掉栈顶元素后偶数栈的顶端："<<sk.getTop2()<<endl; cout<<"现在的栈："<<endl; sk.display(cout); cout<<endl; sk.push(1000); cout<<"放入1000后的栈："<<endl; sk.display(cout); sk.push(1001); cout<<"放入1001后的栈："<<endl; sk.display(cout); return 0; }