堆棧隊(duì)列字符串匹配相關(guān)算法實(shí)現(xiàn)(共17頁)

1、精選優(yōu)質(zhì)文檔-傾情為你奉上堆棧、隊(duì)列、字符串匹配相關(guān)算法C+實(shí)現(xiàn)一、堆棧.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>>

2、;t;STA1.push(t); int ch;cout<<"1:彈棧"<<endl;cout<<"2:獲取棧頂元素:"<<endl;cout<<"3:入棧元素:"<<endl;cout<<"4:輸出棧中元素;"<<endl;cout<<"5:重設(shè)棧的大小:"<<endl;cin>>ch;while(ch!=-1)switch(ch)case 1:int re1;

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

4、t s; cout<<"輸入新的大小:"<<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 * sta

5、ckarray;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()

6、cout<<"?？?"<<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)

7、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<<stackarrayi<<" "二、隊(duì)列.cpp部分#include<iostream>#include"queue.h"using namespace std;int main () linkqueue<int> que1;cout<<&qu

8、ot;輸入隊(duì)列大小:"<<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:輸出隊(duì)首元素:"<<endl;cout<<"3:輸出隊(duì)列元素:"<<endl;cout<&l

9、t;"4:插入元素:"<<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<<"隊(duì)首元素:"<<re2<<endl; break;case 3:que1.print();break;case 4:int temp; co

10、ut<<"輸入元素:"<<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;S

11、LNode( SLNode * nextnode=NULL)next=nextnode;SLNode(const T& item , SLNode * nextnode=NULL)data=item; next=nextnode;template<class T>class linkqueue/ 鏈?zhǔn)疥?duì)列/private:SLNode<T> * front, * rear;int count;public:linkqueue()front=NULL;rear=NULL;linkqueue()qclear();void qinsert(const T &

12、item);bool qdelete(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,NU

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

14、t;class T>bool linkqueue< T>: qget(T& item)if(isempty()cout<<"隊(duì)列為空!"<<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<

15、;class T>void 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&l

16、t;char> list;cout<<"輸入待檢測(cè)算式:"<<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

17、;SLNode(const 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

18、 get(int k, T& 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<c

19、lass T>SLList<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->

20、next; size+;template<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<<"個(gè)元素是:"<<g

21、uard->data<<endl;guard=guard->next;i+;cout<<"第"<<i<<"個(gè)元素是:"<<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->data=