C语言数据结构之简易计算器

#include 
#include 
using namespace std;

class Calculator{
private:
 int Priority(char fuhao);
 double CalSuffix(string PostfixExp);

public:
 double Calculate(string InfixExp);

  string InfixToSuffix(string InfixExp);

};

double Calculator::CalSuffix(string PostfixExp){
 double tmpresult,ch1,ch2;
 double tmpnum,tmpxiaoshu=1;
 int i=0,tmpdashu;
 int isfu=0; ///
 stack stk2;
 while(PostfixExp[i]!='\0'){
  isfu=0; ///
  if(PostfixExp[i]>=48&&PostfixExp[i]=48&&PostfixExp[i]=48&&PostfixExp[i]=48&&PostfixExp[i] stk;
 string PostfixExp = "     ";
 int i=0,j=0;
 char tmpfuhao;
 int flag = 0; //判断多位数的头数是否为零
 while(InfixExp[i]!='\0'){
  if(InfixExp[i]>=48&&InfixExp[i]=48&&InfixExp[i]=48&&InfixExp[i]57)&&InfixExp[i]!=')')){
    i++;
    PostfixExp[j++]='&';
    PostfixExp[j++]='-';
    while(InfixExp[++i]>=48&&InfixExp[i]=48&&InfixExp[i]=Priority(InfixExp[i])){
      PostfixExp[j++] = '&';
      PostfixExp[j++] = tmpfuhao;
      stk.pop();
      if(stk.empty()!=1){
       tmpfuhao = stk.top();
      }
      else break;
     }
     stk.push(InfixExp[i]);
    }
   }
   }
  }
  else{
   cout>a;
 cout
上述是爱站技术频道小编为大家带来的C语言数据结构之简易计算器，相信大家了解的很清楚了，更多的专业知识尽在js.aizhan.com