堆栈队列字符串匹配相关算法实现.docVIP

堆栈、队列、字符串匹配相关算法C++实现 一、堆栈 .cpp部分 #includeiostream #includestack.h using namespace std; int main (){ int c; cout输入堆栈大小:endl; cinc; astackint STA1(c); int t; cout输入栈元素:endl; for(int i=0;ic;i++){ cint; STA1.push(t); } int ch; cout1:弹栈endl; cout2:获取栈顶元素:endl; cout3:入栈元素:endl; cout4:输出栈中元素;endl; cout5:重设栈的大小:endl; cinch; while(ch!=-1){ switch(ch){ case 1:{int re1; STA1.pop(re1); cout删除栈顶元素:re1endl; break;} case 2:{int re2 ; STA1.peek(re2); cout获取栈顶元素:re2endl; break;} case 3:{int r; cout输入入栈元素:endl; cinr; STA1.push(r); break;} case 4:{STA1.print();break;} case 5:{int s; cout输入新的大小:endl; cins; STA1.setsize(s); break;} } cout还需要什么帮助吗?endl; cinch; } if(ch==-1)cout谢谢使用endl; return 0; } .h部分 #includeiostream templateclass T class astack{ //顺序堆栈// private: int size; T * stackarray; int top; int maxstacksize; public: astack(int s ){ maxstacksize=100; size=s; stackarray=new T [maxstacksize]; top=-1; } ~astack(){delete [] stackarray;} bool push(const T item){ if(isfull()) { cout栈满!endl; return false; } stackarray[++top]=item; return true; } bool pop( T item){ if(isempty()){ cout栈空!endl; return false; } item =stackarray[top--]; return true; } bool peek(T item)const{ if(isempty()){ cout栈空!endl; return false; } item=stackarray[top]; return true; } int isempty(void)const{return top==-1;} int isfull(void)const{return top==size-1;} void clear(void){top=-1;} void print(); void setsize(int s){size=s;} }; templateclass T void astackT::print(){ for(int i=0;isize;i++)coutstackarray[i] ; } 二、队列 .cpp部分 #includeiostream #includequeue.h using namespace std; int main (){ linkqueueint que1; cout输入队列大小:endl; int s; cins; cout输入元素:endl; int c; for(int i=0;is;i++){ cinc; que1.qinsert(c); } int ch; cout1:删除元素:endl; cout2:输出队首元素:e