类模板用两个栈模拟一个队列.docx

类模板用两个栈模拟队列的出栈入栈/stack.h#ifndef STACK_H#define STACK_H#include using namespace std;templateclass SeqQueue;templateclass SeqStackfriend class SeqQueue;protected:int top;int maxsize;type *elems; public:SeqStack(int size =100);virtual SeqStack(); int isempty()const; void Push(const type e); void Pop();templateSeqStack:SeqStack(int size)maxsize=size;if(elems!=NULL) deleteelems;elems=new type maxsize;top=-1;templateSeqStack:SeqStack()deleteelems;template int SeqStack:isempty()constif(top=-1)return 1;elsereturn 0;template void SeqStack:Push(const type e)if(top=maxsize)return;elems+top=e;template void SeqStack:Pop()if(isempty()return;top-;#endif/queue.h#ifndef QUEUE_H#define QUEUE_H#include stack.htemplateclass SeqQueueprotected:SeqStack s1;SeqStack s2;public:int isempty()const;void inqueue(const type e);void outqueue();void show(const int number)const;templatevoid SeqQueue:inqueue(const type e) if(s1.top=s1.maxsize)return; else if (s2.isempty()=0) for( ;s2.top!=-1&s1.top!=s1.maxsize;s2.top-) s1.Push(s2.elemss2.top); s1.Push(e); else s1.Push(e);templatevoid SeqQueue:outqueue()if(s2.isempty()=0)s2.Pop();else if(s1.isempty()=0)for(;s1.top!=-1;s1.top-)s2.Push(s1.elemss1.top);s2.Pop();elsereturn ;templateint SeqQueue:isempty()constif(s1.isempty&s2.isempty)return 1; else return 0;templatevoid SeqQueue:show(const int number)const if(number=1) if(s1.isempty()cout队列为空endl;for(int i=0;i=s1.top;i+)couts1.elemsi ;cout endl;elseif(s2.isempty()cout队列为空=0;i-)couts2.elemsi ;cout endl;#endif/3.cpp#include queue.hint main()int select,i,n1,n2,x;SeqQueue s; cinselect;while(select) switch(select)case 1:cout输入入栈数目n1; f