文档介绍：堆栈、队列、字符串匹配相关算法 C++ 实现一、 部分#include<iostream> #include"" using namespace std; int main (){ int c; cout<<" 输入堆栈大小:"<<endl; cin>>c; astack<int> STA1(c); int t; cout<<" 输入栈元素:"<<endl; for(int i=0;i<c;i++){ cin>>t; (t); } int ch; cout<<"1: 弹栈"<<endl; cout<<"2: 获取栈顶元素:"<<endl; cout<<"3: 入栈元素:"<<endl; cout<<"4: 输出栈中元素;"<<endl; cout<<"5: 重设栈的大小:"<<endl; cin>>ch; while(ch!=-1){ switch(ch){ case 1:{int re1; (re1); cout<<" 删除栈顶元素:"<<re1<<endl; break;} case 2:{int re2 ; (re2); cout<<" 获取栈顶元素:"<<re2<<endl; break;} case 3:{int r; cout<<" 输入入栈元素:"<<endl; cin>>r; (r); break;} case 4:{();break;} case 5:{int s; cout<<" 输入新的大小:"<<endl; cin>>s; (s); break;} } cout<<" 还需要什么帮助吗?"<<endl; cin>>ch; } if(ch==-1)cout<<" 谢谢使用"<<endl; return 0;} .h部分#include<iostream> template<class 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;} }; template<class T> void astack<T>::print(){ for(int i=0;i<size;i++)cout<<stackarray[i]<<" "; } 二、 部分#include<iostream> #include"" using namespace std; int main (){ linkqueue<int> que1; cout<<" 输入队列大小:"<<endl; int s; cin>>s; cout<<" 输入元素:"<<endl; int c; for(int i=0;i<s;i++){ cin>>c; (c); } int ch; cout<<"1: 删除元素:"<<endl; cout<<"2: 输出队首元素:"<<endl; cout<<"3: 输出队列元素:"<<endl; cout<<"4: 插入元素:"<<endl; cin>>ch; while(ch!=-1){ switch(ch)