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

1、堆栈、队列、字符串匹配相关算法C+实现一、堆栈.cpp部分#include<iostream>#include"stack.h"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;STA1.push(

2、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; STA1.pop(re1)

3、; cout<<"删除栈顶元素:"<<re1<<endl; break;case 2:int re2 ; STA1.peek(re2); cout<<"获取栈顶元素:"<<re2<<endl; break;case 3:int r; cout<<"输入入栈元素:"<<endl; cin>>r; STA1.push(r); break;case 4:STA1.print();break;case 5:int s; cout<

4、<"输入新的大小:"<<endl; cin>>s; STA1.setsize(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 t

5、op;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<<&

6、quot;栈空!"<<endl;return false;item =stackarraytop-;return true;bool peek(T &item)constif(isempty()cout<<"栈空!"<<endl;return false;item=stackarraytop;return true;int isempty(void)constreturn top=-1;int isfull(void)constreturn top=size-1;void clear(void)top=-1;void p

7、rint();void setsize(int s)size=s;template<class T>void astack<T>:print()for(int i=0;i<size;i+)cout<<stackarrayi<<" "二、队列.cpp部分#include<iostream>#include"queue.h"using namespace std;int main () linkqueue<int> que1;cout<<"输入队列大小:&qu

8、ot;<<endl;int s;cin>>s;cout<<"输入元素:"<<endl;int c;for(int i=0;i<s;i+)cin>>c;que1.qinsert(c);int ch;cout<<"1:删除元素:"<<endl;cout<<"2:输出队首元素:"<<endl;cout<<"3:输出队列元素:"<<endl;cout<<"4:插入元

9、素:"<<endl;cin>>ch;while(ch!=-1)switch(ch)case 1:int re1; cout<<"已删除元素:"<< que1.qdelete(re1)<<endl; break;case 2:int re2; que1.qget(re2); cout<<"队首元素:"<<re2<<endl; break;case 3:que1.print();break;case 4:int temp; cout<<&qu

10、ot;输入元素:"<<endl; cin>>temp; que1.qinsert(temp); break;cout<<"还需要什么帮助吗?"<<endl;cin>>ch;if(ch=-1)cout<<"谢谢使用"<<endl;return 0;.h部分#include<iostream>template< class T>struct SLNodeT data;SLNode <T> * next;SLNode( SLNode

11、 * nextnode=NULL)next=nextnode;SLNode(const T& item , SLNode * nextnode=NULL)data=item; next=nextnode;template<class T>class linkqueue/ 链式队列/private:SLNode<T> * front, * rear;int count;public:linkqueue()front=NULL;rear=NULL;linkqueue()qclear();void qinsert(const T & item);bool qd

12、elete(T & item); bool qget(T& item);int isempty()constreturn front=NULL;void qclear();void print();template<class T>void linkqueue<T>:qinsert(const T&item)if(isempty()front=rear=new SLNode<T>(item,NULL);count=1;else rear->next=new SLNode<T>(item,NULL);rear=rear

13、->next;count+;template <class T>bool linkqueue<T>: qdelete(T& item)if(isempty()cout<<"队列为空!"<<endl;return false;SLNode <T>* temp=front;item=front->data;front=front->next;count-; delete temp;if(count=0)rear=NULL;return true;template <class T>

14、bool linkqueue< T>: qget(T& item)if(isempty()cout<<"队列为空!"<<endl;return false; item=front->data;return true;template <class T>void linkqueue<T>:qclear()while(!isempty()rear=front;front=front->next;delete rear;count-;rear=NULL;template<class T>v

15、oid linkqueue<T>:print() SLNode<T> * p=front; while(p->next!=NULL) cout<<p->data<<" " p=p->next; cout<<p->data<<endl;三、字符串匹配.cpp部分#include<iostream>#include"Choice.h"using namespace std;int main ()char re;SLList<char> li

16、st;cout<<"输入待检测算式:"<<endl;cin>>re;while(re!='#')list.add(re);cin>>re; list.listout();check(list);return 0;.h部分#include<iostream>template<class T>struct SLNodeT data;SLNode <T> * next;SLNode( SLNode * nextnode=NULL)next=nextnode;SLNode(const

17、 T& item , SLNode * nextnode=NULL)data=item; next=nextnode;template<class T>class SLList private: SLNode<T> * head, *tail ,*guard; int size; public: SLList(); SLList(T& item); SLList(); bool isempty()return head->next=NULL; int lenth(); void add(T& item); bool get(int k, T

18、& item); void listout(); void match();template<class T>SLList<T>:SLList()head=tail=guard=new SLNode<T>();size=0;template<class T>SLList<T>:SLList(T& item) tail=guard=new SLNode<T>(item,NULL);head=new SLNode<T>(guard);size=1;template<class T>SLL

19、ist<T>:SLList()while(!isempty()guard=head; head=guard->next;delete guard;delete head;template<class T>int SLList<T>:lenth()return size;template<class T>void SLList<T>:add(T& item) tail->next=new SLNode<T> (item,tail->next); tail=tail->next; size+;t

20、emplate<class T>void SLList<T>:listout()if(isempty()cout<<"链表空!"<<endl;elsecout<<"链表大小:"<<size<<endl; int i=0;guard=head->next;while(guard->next!=NULL)cout<<"第"<<i<<"个元素是:"<<guard->data

21、<<endl;guard=guard->next;i+;cout<<"第"<<i<<"个元素是:"<<guard->data<<endl;template<class T>void SLList<T>:match()char s150;char s250;int i=0, j=0;int rei ,rej; guard=head;while(guard->next!=NULL)if(guard->data=''|guard->data=''|guard->data='(')s1i=guard->data;i+; guard=guard->next;else if(guard->data=''|guard->da