數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)報(bào)告三棧的實(shí)現(xiàn)

實(shí)驗(yàn)報(bào)告實(shí)驗(yàn)題目：棧的實(shí)現(xiàn)實(shí)驗(yàn)?zāi)康模赫莆諚５奶攸c(diǎn)。熟悉在棧上進(jìn)行的各種操作。實(shí)驗(yàn)要求：1．建立一個(gè)接口，定義一些常用的基本方法；2．用類實(shí)現(xiàn)該接口的基本方法：入棧；出棧；取棧頂元素；判空、判滿；3．定義客戶類來調(diào)用接口中的方法；實(shí)驗(yàn)環(huán)境：一臺(tái)PC機(jī)，Eclipse軟件程序代碼：a．棧的接口：packageStack;publicinterfaceStackInterface<T>{publicvoidpush(TnewEntry);publicTpop();publicTpeek();publicbooleanisEmpty();publicvoidclear();}b．基于鏈表的實(shí)現(xiàn)的方法類packageStack;publicclassLinkedStack<T>implementsStackInterface<T>,java.io.Serializable{privateNodetopNode;//引用鏈表中第一個(gè)結(jié)點(diǎn)publicLinkedStack(){ topNode=null;} publicvoidpush(TnewEntry){//將新元素插入棧頂 //TODOAuto-generatedmethodstub NodenewNode=newNode(newEntry,topNode); topNode=newNode;//將新結(jié)點(diǎn)指向棧頂結(jié)點(diǎn) } publicTpop(){//刪除并返回棧頂 //TODOAuto-generatedmethodstub Ttop=null; if(topNode!=null) { top=topNode.getData(); topNode=topNode.getNextNode(); } returntop; } publicTpeek(){//取出棧頂并且不以任何方式改變棧 //TODOAuto-generatedmethodstub Ttop=null; if(topNode!=null) top=topNode.getData(); returntop; } publicbooleanisEmpty(){檢查棧是否為空 //TODOAuto-generatedmethodstub returntopNode==null; } publicvoidclear(){從棧中刪除所有元素 //TODOAuto-generatedmethodstub topNode=null; } privateclassNodeimplementsjava.io.Serializable//構(gòu)造私有類Node { privateTdata; privateNodenext; privateNode(TdataPortion) { data=dataPortion; next=null; } privateNode(TdataPortion,NodenextNode) { data=dataPortion; next=nextNode; } TgetData() { returndata; } voidsetData(TnewData) { data=newData; } NodegetNextNode() { returnnext; } voidsetNextNode(NodenextNode) { next=nextNode; } }}c.基于數(shù)組的實(shí)現(xiàn)的方法類packageStack;publicclassArrayStack<T>implementsStackInterface<T>{ privateT[]stack;//存放棧元素的數(shù)組 privateinttopIndex;//棧頂元素索引 privatestaticfinalintDEFAULF_MAX_SIZE=50; publicArrayStack() { this(DEFAULF_MAX_SIZE); } publicArrayStack(intinitialCapacity) { stack=(T[])newObject[initialCapacity]; topIndex=-1; } publicvoidpush(TnewEntry){//將新元素插入棧頂 //TODOAuto-generatedmethodstub topIndex++; if(topIndex>=stack.length)//若數(shù)組已滿 doubleArray();//擴(kuò)展數(shù)組 stack[topIndex]=newEntry;//將新元素插入棧頂 } privatevoiddoubleArray()//擴(kuò)展數(shù)組 { T[]oldList=stack; intoldSize=oldList.length; stack=(T[])newObject[2*oldSize]; for(intindex=0;index<oldSize;index++) stack[index]=oldList[index]; } publicTpop(){//刪除并返回棧頂 //TODOAuto-generatedmethodstub Ttop=null; if(!isEmpty()) { top=stack[topIndex]; stack[topIndex]=null; topIndex--; } returntop; } publicTpeek(){//取出棧頂并且不以任何方式改變棧 //TODOAuto-generatedmethodstub Ttop=null; if(!isEmpty()) top=stack[topIndex]; returntop; } publicbooleanisEmpty(){//檢查棧是否為空 //TODOAuto-generatedmethodstub returntopIndex<0; } publicvoidclear(){從棧中刪除所有元素 //TODOAuto-generatedmethodstub for(topIndex=stack.length;topIndex>0;topIndex--) pop(); }}d．基于鏈表的實(shí)現(xiàn)類packageStack;publicclassClientStack{ /** *@paramargs */ publicstaticvoidmain(String[]args){ //TODOAuto-generatedmethodstubStackInterface<String>myStack=newLinkedStack<String>();myStack.push("Jim");myStack.push("Jess");myStack.push("Jill");myStack.push("Jane");myStack.push("Joe");Stringtop=(String)myStack.peek();System.out.println(top+"isatthetopofthestack.");top=(String)myStack.pop();System.out.println(top+"isremoveedfromthestack.");top=(String)myStack.peek();System.out.println(top+"isatthetopofthestack.");top=(String)myStack.pop();System.out.println(top+"isremoveedfromthestack."); }}e.基于數(shù)組的實(shí)現(xiàn)類packageStack;publicclassClientArrayStack{ publicstaticvoidmain(String[]args){StackInterfacetryRunArray=newArrayStack();tryRunArray.push("41");tryRunArray.push("42");tryRunArray.push("43");tryRunArray.push("44");tryRunArray.push("45");Objecttop=tryRunArray.peek();System.out.println(top+"isatthetopofthestack.");top=tryRunArray.pop();System.out.println(top+"isremoveedfromthestack.