實(shí)驗(yàn)二：棧和隊(duì)列的基本操作實(shí)現(xiàn)及其應(yīng)用

1、實(shí)驗(yàn)二：棧和隊(duì)列的基本操作實(shí)現(xiàn)及其應(yīng)用第一題一、問題描述對(duì)于一個(gè)從鍵盤輸入的字符串，判斷其是否為回文?；匚募凑葱蛳嗤?。如“abba”是回文，而“abab”不是回文。二、基本要求（1）數(shù)據(jù)從鍵盤讀入；（2）輸出要判斷的字符串；（3）利用棧的基本操作對(duì)給定的字符串判斷其是否是回文，若是則輸出“Yes”，否則輸出“No”。三、設(shè)計(jì)具體實(shí)現(xiàn)1總體設(shè)計(jì)以及詳細(xì)設(shè)計(jì)struct Stackint Data;char *base;char *top;void InitStack(Stack &S);/創(chuàng)建棧void Push(Stack &S, char e);/進(jìn)棧char Pop(St

2、ack &S);/出棧#include<iostream>#include<string>using namespace std;const int a = 100;struct Stackint Data;char *base;char *top;void InitStack(Stack &S)/生成棧S.base = (char*)malloc(a*sizeof(char);S.top = S.base;S.Data = a;void Push(Stack &S, char e)/入棧*(S.top)=e;S.top+;char Pop(St

3、ack &S)/出棧char e;S.top-;e=*(S.top);return e;int main()Stack S;InitStack(S);int i=0,e,q=0,p=0,l;/q的作用是如果出棧跟字符一樣就加1。最后等于棧長(zhǎng)說明是回文 string s;cin>>s;l=s.length();int L=l;while(l>0)Push(S,si);i+;l-;i=0;while (S.top !=S.base)e=Pop(S);if(e=si)q+;i+;if(L=q)cout<<"是回文"<<endl;e

4、lsecout<<"不是回文"<<endl;return 0;2.調(diào)試及問題解決 1,第一組測(cè)試2.第二組測(cè)試3.第三組測(cè)試第二題一、問題描述編程模擬隊(duì)列的管理，主要包括：出隊(duì)列、入隊(duì)、統(tǒng)計(jì)隊(duì)列的長(zhǎng)度、查找隊(duì)列某個(gè)元素e、及輸出隊(duì)列中元素。二、設(shè)計(jì)具體實(shí)現(xiàn)1總體設(shè)計(jì)以及詳細(xì)設(shè)計(jì)typedef struct /循環(huán)隊(duì)列結(jié)構(gòu)體char *base; int front; int rear;SqQueue;int InitQueue(SqQueue &Q)/構(gòu)造一個(gè)空隊(duì)列Qint QueueLength(SqQueue &Q)/隊(duì)列長(zhǎng)度in

5、t EnQueue(SqQueue &Q,char e)/插入元素e到Q的隊(duì)尾int FindQueue(SqQueue &Q,char e)/在Q隊(duì)列中查找e元素 if(Q.rear+1)%MAXQSIZE=Q.front) return ERROR; Q.baseQ.rear=e; Q.rear=(Q.rear+1)%MAXQSIZE; return OK; return (Q.rear-Q.front+MAXQSIZE)%MAXQSIZE; Q.base=(char*)malloc(MAXQSIZE*sizeof(char); if(!Q.base) return ERR

6、OR; Q.front=Q.rear=0; return OK;if(Q.front=Q.rear) return ERROR; while(e!=Q.baseQ.front) Q.front=(Q.front+1)%MAXQSIZE;if(Q.front=Q.rear) return ERROR;int DeQueue(SqQueue &Q,char e)/刪除Q的隊(duì)頭元素，用e返回其值 if(Q.front=Q.rear) return ERROR; e=Q.baseQ.front; cout<<"該元素在表頭！"<<endl; retu

7、rn OK;Q.front=(Q.front+1)%MAXQSIZE;int OutputQueue(SqQueue &Q)/輸出Q隊(duì)列中所有元素void main()char e; int i，j; SqQueue Q; char e; if(Q.front=Q.rear) return ERROR; while(Q.front!=Q.rear) return OK; e=Q.baseQ.front; cout<<e; Q.front=(Q.front+1)%MAXQSIZE; return OK;InitQueue(Q);while(1) cout<<&qu

8、ot;1.入隊(duì)"<<endl; cout<<"2.出隊(duì)列"<<endl; cout<<"3.統(tǒng)計(jì)隊(duì)列的長(zhǎng)度"<<endl; cout<<"4.查找隊(duì)列某個(gè)元素e"<<endl; cout<<"5.輸出隊(duì)列中元素"<<endl;cout<<"6.退出"<<endl; cout<<"請(qǐng)輸入你要操作的序號(hào)(15):" cin>

9、;>i; if(i=1)cout<<"請(qǐng)輸入入隊(duì)元素:" cin>>e;EnQueue(Q,e); if(i=2)DeQueue(Q,e);cout<<"出隊(duì)元素為:"<<e<<endl; if(i=3) j=QueueLength(Q);cout<<"隊(duì)列長(zhǎng)隊(duì)為："<<j<<endl; if(i=4) cout<<"請(qǐng)輸入你要查找的元素:" cin>>e;FindQueue(Q,e); if(i=5) OutputQueue(Q);cout<<endl; if(i=6) break;2.調(diào)試及問題解決1.入隊(duì)2.出隊(duì)列3.隊(duì)列的長(zhǎng)度