棧和隊(duì)列的基本操作及其應(yīng)用

第8頁共9頁第1頁共3頁實(shí)驗(yàn)報(bào)告課程名稱：任課教師：實(shí)驗(yàn)日期：班級：姓名：學(xué)號：實(shí)驗(yàn)項(xiàng)目名稱：棧和隊(duì)列的基本操作及其應(yīng)用一、實(shí)驗(yàn)?zāi)康募耙笳莆諚：完?duì)列的順序存儲結(jié)構(gòu)和鏈?zhǔn)酱鎯Y(jié)構(gòu)，以便在實(shí)際中靈活應(yīng)用。掌握棧和隊(duì)列的特點(diǎn)，即后進(jìn)先出和先進(jìn)先出的原則。掌握棧和隊(duì)列的基本運(yùn)算，如：入棧與出棧，入隊(duì)與出隊(duì)等運(yùn)算在順序存儲結(jié)構(gòu)和鏈?zhǔn)酱鎯Y(jié)構(gòu)上的實(shí)現(xiàn)。二、實(shí)驗(yàn)環(huán)境1．系統(tǒng)軟件：Windows2000、SQLServer20002．工具：Visualstudio6.0或Visualstudio2003三、實(shí)驗(yàn)內(nèi)容與步驟:1：字符串倒序2：回文判斷對于一個(gè)從鍵盤輸入的字符串，判斷其是否為回文?；匚募凑葱蛳嗤?。如“abba”是回文，而“abab”不是回文。3：設(shè)有兩個(gè)棧S1,S2都采用順序棧方式，并且共享一個(gè)存儲區(qū)[O..maxsize-1],為了盡量利用空間，減少溢出的可能，可采用棧頂相向，迎面增長的存儲方式。試設(shè)計(jì)S1,S2有關(guān)入棧和出棧的操作算法。實(shí)驗(yàn)過程：1：#include<iostream>usingnamespacestd;typedefdoubleStack_entry;constintmaxstack=20;enumError_code{underflow,overflow,success};classStack{public:Stack();boolempty()const;Error_codepop();Error_codetop(Stack_entry&item)const;Error_codepush(constStack_entry&item);private: intcount; Stack_entryentry[maxstack];};Stack::Stack(){count=0;}boolStack::empty()const{booloutcome=true;if(count>0) outcome=false; returnoutcome;}Error_codeStack::push(constStack_entry&item){ Error_codeoutcome=success; if(count==0) outcome=overflow; else entry[count++]=item; returnoutcome;}Error_codeStack::pop(){Error_codeoutcome=success;if(count==0) outcome=underflow; else--count; returnoutcome;}Error_codeStack::top(Stack_entry&item)const{Error_codeoutcome=success; if(count==0) outcome=underflow; else item=entry[count-1]; returnoutcome;}voidmain(){intn; doubleitem; Stacknumbers; cin>>n; for(inti=0;i<n;i++){ cin>>item; numbers.push(item); } cout<<endl<<endl; while(!numbers.empty()){ cout<<numbers.top(item)<<""; numbers.pop(); } cout<<endl;}實(shí)驗(yàn)結(jié)果：1：2：#include<iostream>usingnamespacestd;typedefcharStack_entry;constintmaxstack=5;enumError_code{success,underflow,overflow};classStack{public: Stack(); boolempty(); Error_codepop(); Error_codetop(Stack_entry&item); Error_codepush(Stack_entry&item);private: intcount; Stack_entryentry[maxstack];};boolStack::empty(){ booloutcome=true; if(count>0) outcome=false; returnoutcome;}Error_codeStack::pop(){ Error_codeoutcome=success; if(count==0) outcome=underflow; else--count; returnoutcome;}Error_codeStack::top(Stack_entry&item){ Error_codeoutcome=success; if(count==0) outcome=underflow; else item=entry[count-1]; returnoutcome;}Error_codeStack::push(Stack_entry&item){ Error_codeoutcome=success; if(count>=maxstack) outcome=overflow; else entry[count++]=item; returnoutcome;}Stack::Stack(){ count=0;}voidmain(){ inti; intc[maxstack]; charitem;Stackstra;for(i=0;i<maxstack;i++){ cin>>item; c[i]=item; stra.push(item); } for(i=0;i<maxstack;i++){ stra.top(item); if(c[i]==item)stra.pop(); elsebreak; } if(i==maxstack)cout<<"是回文數(shù)"; elsecout<<"不是回文數(shù)"<<endl；}實(shí)驗(yàn)結(jié)果：2：3：#include<iostream>usingnamespacestd;typedefcharStack_entry;constintmaxstack=50;enumError_code{success,underflow,overflow};classStack{public: Stack(); boolempty(); Error_codepop(); Error_codetop(Stack_entry&item); Error_codepush(Stack_entry&item);private: intcount; Stack_entryentry[maxstack];};boolStack::empty(){ booloutcome=true; if(count>0) outcome=false; returnoutcome;}Error_codeStack::pop(){ Error_codeoutcome=success; if(count==0) outcome=underflow; else--count; returnoutcome;}Error_codeStack::top(Stack_entry&item){ Error_codeoutcome=success; if(count==0) outcome=underflow; else item=entry[count-1]; returnoutcome;}Error_codeStack::push(Stack_entry&item){ Error_codeoutcome=success; if(count>=maxstack) outcome=overflow; elseentry[count++]=item; returnoutcome;}Stack::Stack(){ count=0;}classStack2{public: Stack2(); boolempty(); Error_codepop(); Error_codetop(Stack_entry&item); Error_codepush(Stack_entry&item);private: intcount; Stack_entryentry[maxstack];};boolStack2::empty(){ booloutcome=true; if(count<maxstack) outcome=false; returnoutcome;}Error_codeStack2::pop(){ Error_codeoutcome=success; if(count==maxstack) outcome=underflow; else++count; returnoutcome;}Error_codeStack2::top(Stack_entry&item){ Error_codeoutcome=success; if(count==maxstack) outcome=underflow; else item=entry[count+1]; returnoutcome;}Error_codeStack2::push(Stack_entry&item){ Error_codeoutcome=success; if(count<=0) outcome=overflow; else entry[count--]=item; returnoutcome;}Stack2::Stack2(){ count=maxstack;}voidmain(){ chara[maxstack]; charb[maxstack]; charc[maxstack]; inti;charitem; Stacks1; Stack2s2; for(i=0;i<10;i++){