Calculate The Infix Expression With Stack

  1 // 对string数式的计算（基于中缀转后缀）.cpp : 定义控制台应用程序的入口点。
  2 //
  3 
  4 #include "stdafx.h"
  5 #include <string>
  6 #include <stack>
  7 #include <cctype>
  8 #include <iostream>
  9 
 10 //计算后缀表达式。（int类型）
 11 int postfixExp(const std::string& exp)
 12 {
 13     std::stack<int> numSta;
 14     for (int i = 0; i != exp.size(); i++)
 15     {
 16         //将表达式中的数字压入栈中
 17         std::string num;
 18         while (isdigit(exp[i])) 
 19         {
 20             num.push_back(exp[i]);
 21             i++;
 22         }
 23 
 24         if (!num.empty())  numSta.push(atoi(num.c_str()));
 25 
 26         //遇到空格继续迭代
 27         if (exp[i] == ‘ ‘) continue;
 28         
 29         //遇到操作符将栈顶的两个元素弹出并将计算结果压入栈中
 30         if (exp[i] == ‘+‘ || exp[i] == ‘-‘ || exp[i] == ‘*‘ || exp[i] == ‘/‘)
 31         {
 32             int num1;
 33             int num2;
 34             if (!numSta.empty())
 35             {
 36                 num1 = numSta.top();
 37                 numSta.pop();
 38             }
 39             if (!numSta.empty())
 40             {
 41                 num2 = numSta.top();
 42                 numSta.pop();
 43             }
 44             //计算
 45             switch (exp[i])
 46             {
 47             case ‘+‘: numSta.push(num1 + num2);
 48                 break;
 49             case ‘-‘: numSta.push(num1 - num2);
 50                 break;
 51             case ‘*‘: numSta.push(num1 * num2);
 52                 break;
 53             case ‘/‘: numSta.push(num1 / num2);
 54                 break;
 55             default:
 56                 break;
 57             }
 58         }
 59 
 60     }
 61     return numSta.top();
 62 }
 63 
 64 //中缀转后缀 e.g. 2 + 3 * 5 + (7 * 8  + 9) * 10 ->  2 3 5 * + 7 8 * 9 + 10 * +
 65 std::string postfixToInfix(const std::string& exp)
 66 {
 67     std::string result;
 68     std::stack<char> operators;
 69     for (int i = 0; i < exp.size(); i++)
 70     {
 71         while (isdigit(exp[i]))
 72         {
 73             result.push_back(exp[i]);
 74             i++;
 75         }
 76         //若末尾数字非个位数，数组索引将越界,由于string不是真正意义上的字符数组，越界对结果没有影响
 77         //if (i >= exp.size()) break;
 78         //添加空格分隔符
 79         result.push_back(‘ ‘);
 80         //遇到空格继续迭代
 81         if (exp[i] == ‘ ‘) continue;
 82         //遇到操作符时，检查栈顶元素优先级，若为高优先级/等优先级操作符，弹出栈中操作符，完成后将表达式的操作符压入
 83         if (exp[i] == ‘+‘ || exp[i] == ‘-‘)
 84         {
 85             while (!operators.empty() && operators.top() != ‘(‘)
 86             {
 87                 //当栈顶元素为 + - * / 时 , ( 在栈中优先级最低，在表达式中优先级最高
 88                     result.push_back(operators.top());
 89                     operators.pop();
 90                     result.push_back(‘ ‘);
 91             }
 92             operators.push(exp[i]);
 93         }
 94         else if (exp[i] == ‘*‘ || exp[i] == ‘/‘)
 95         {
 96             while (!operators.empty() && (operators.top() == ‘*‘ || operators.top() == ‘/‘))
 97             {
 98                 //if (operators.top() == ‘*‘ || operators.top() == ‘/‘)
 99                     result.push_back(operators.top());
100                     operators.pop();
101                     result.push_back(‘ ‘);
102             }
103             operators.push(exp[i]);
104         }
105         else if (exp[i] == ‘(‘) operators.push(‘(‘);
106         else if (exp[i] == ‘)‘)
107         {
108             while (operators.top() != ‘(‘)
109             {
110                 result.push_back(operators.top());
111                 operators.pop();
112                 result.push_back(‘ ‘);
113             }
114             //弹出 ( 
115             operators.pop();
116         }
117         
118     }
119     while (!operators.empty())
120     {
121         result.push_back(operators.top());
122         result.push_back(‘ ‘);
123         operators.pop();
124     }
125     
126     return result;
127 }
128 
129 int main()
130 {
131     std::cout << postfixExp(postfixToInfix("2 + 3 * 5 + (7 * 8  + 9) * 10")) << std::endl;
132      system("pause");
133     return 0;
134 }