栈的模板C++.docxVIP

#include Stack.h#include iostream#include string.husing namespace std;//声明一个栈模板template class Tclass Stack {public:Stack(int size):lList(size){}bool push(T item);bool pop(T item);bool getTop(T item);bool isEmpty(){return lList.ListEmpty();} bool isFull(){return lList.ListFull();}private:LinearListT lList;};templateclass Tbool StackT::push(T item) {if(lList.ListFull())return false;int a=lList.ListLength();lList.InsertElem(item,a);return true;}templateclass Tbool StackT::pop(T item){if(this-isEmpty())return false;lList.getElem(lList.ListLength()-1,item);lList.DeleteElem(lList.ListLength()-1);return true;}templateclass Tbool StackT::getTop(T item){if(lList.ListEmpty())return false;lList.getElem(lList.ListLength()-1,item);return true;}//将读入的字符串转化成整数int change(char *a){int i=strlen(a);int res=0;if (a[0]==-){int k=1;for(int j=i-1;j0;j--){res+=(a[j]-0)*k;k*=10;}res*=-1;return res;}if(a[0]==+){int k=1;for(int j=i-1;ji;j--){res+=(a[j]-0)*k;k*=10;}}else{int k=1;for(int j=i-1;j=0;j--){res+=(a[j]-0)*k;k*=10;}}return res;}//判断输入的是操作数还是运算符，是操作数返回0int jud(char *a){switch(a[0]){case +:if(strlen(a)==1)return 1;elsereturn 0;case -:if(strlen(a)==1)return 2;elsereturn 0;case *:return 3;case /:return 4;default:return 0;}}//对出现的运算符进行处理,在栈中弹出两个值进行处理，先出的为右值int deal(char *a,Stackint b){int res=0;int c,d;switch(a[0]){case +:b.pop(d);b.pop(c);res=c+d;break;case -:b.pop(d);b.pop(c);res=c-d;break;case *:b.pop(d);b.pop(c);res=c*d;break;case /:b.pop(d);b.pop(c);res=c/d;break;}return res;}void main(){char a[10];int res=0;//建立操作数栈Stackint Num(100);cout请输入后缀表达式，以end结尾：endl;cina;while(strcmp(a,end)!=0){if(jud(a)==0){int b=change(a);Num.push(b);}else{res+=deal(a,Num);Num.push(res);res=0;}cina;}Num.getTop(res);coutresendl;}