数据结构实验-堆栈的应用（数字表达式计算和迷宫）

#include <iostream> #include "Stack.h" #include "Stacknew.h" using namespace std; bool Makesur(char& x); void main(void) { const int Maxlength=100; char expr[100]; cout<<"输入你想计算的表达式"<<endl; cin.getline(expr,100); Stack opera(Maxlength); Stacknew num(Maxlength); //Stack<int> num(100); puts(expr); int length=strlen(expr); bool tr=false; char temp; char en='#'; char nestr[100]; int index=0; opera.Add(en); for(int i=1;i<=length;i++){ if(Makesur(expr[i-1])){ while(opera.Addex(expr[i-1])){ opera.Delete(temp); nestr[index++]=temp; } }else{ nestr[index++]=expr[i-1]; } } while(!opera.isOk()){ opera.Delete(temp); nestr[index++]=temp; } int total=index; cout<<"转变后的值为:"; for(int k=1;k<=total;k++){ cout<<nestr[k-1]; } cout<<endl; for(int j=1;j<=total;j++){ char temp1; temp1=nestr[j-1]; if(!Makesur(temp1)){ int a=temp1-48; num.Add(a); }else{ int a1,a2,result; num.Delete(a2); num.Delete(a1); switch(temp1) { case '*': result=a1*a2; num.Add(result); break; case '/': result=a1/a2; num.Add(result); break; case '+': result=a1+a2; num.Add(result); break; case '-': result=a1-a2; num.Add(result); break; } } } cout<<"计算结果为："; int final; num.Delete(final); cout<<final<<endl; } bool Makesur(char& x){ switch(x) { case '*': return true; break; case '/': return true; break; case '+': return true; break; case '-': return true; break; case '(': return true; break; case ')': return true; break; } return false; }