简易计算器-堆栈实现.docx

#includeiostream#includestack#includequeue#includestring#includecctype#includestdio.h#pragma warning(disable:4996)using namespace std;class Expression{public:void setExpression();//从屏幕获取一行 计算式子void calculationResult();//计算出结果，并输出private:void transformation();//将中缀表达式转换成后缀表达式stackstring stringStack;//栈queuestring stringQueueMiddle;//存储中缀表达式的队列queuestring stringQueueBack;//存储后缀表达式的队列};void Expression::setExpression(){char ch[200];string str;//获取屏幕的表达式string strNumber;//暂时存储 数字string strSymbol;//暂时存储 运算符int i = 0;cout 请输入一个表达式（不需要输入=，请不要输入无谓的字符隔开，比如空格）: endl;cout \t;cin.getline(ch, 200);str = ch;for (i = 0; i str.size(); i++) {if (str[i] = 0str[i] = 9) {strNumber += str[i];}else {stringQueueMiddle.push(strNumber);//将数字添加到队列strNumber.clear();//清空字符串strSymbol += str[i];stringQueueMiddle.push(strSymbol);//将符号添加到队列strSymbol.clear();//清空字符串}}//将最后一个数字添加到队列stringQueueMiddle.push(strNumber);//将数字添加到队列strNumber.clear();//清空字符串transformation();}void Expression::transformation(){int i = 0;for (; !stringQueueMiddle.empty(); stringQueueMiddle.pop()) {if (isdigit(stringQueueMiddle.front()[0]))//判断该字符串的第一个字符是否为数字stringQueueBack.push(stringQueueMiddle.front());//纯数字 则将该 字符串 添加到 后缀表达式队列else if (stringStack.empty() || ( == stringQueueMiddle.front()[0])stringStack.push(stringQueueMiddle.front());//如果栈空或者遇到 (，则直接进栈else if (+ == stringQueueMiddle.front()[0] || - == stringQueueMiddle.front()[0]) {if (!stringStack.empty()*==stringStack.top()[0]||/ == stringStack.top()[0]) {//栈不空,则栈中有 */ 则出栈//栈中只要有连续的 +-*/就出栈，且栈不能为空，遇到(也不出栈for (; !stringStack.empty() (!= stringStack.top()[0]; stringStack.pop()) stringQueueBack.push(stringStack.top());// */ 进入 后缀表达式队列}else if (!stringStack.empty() + == stringStack.top()[0] || - == stringStack.top()[0]) {//如果遇到同等级的运算符，则先出栈再进栈stringQueueBack.push(stringStack.top());stringStack.pop();//栈顶出栈}stringStack.push(stringQueueMiddle.front());//+-优先级低，直接进栈}else if (* == stringQueueMiddle.front()[0] || / == stringQueueMiddle.front()[0]) {if (!stringStack.empty() * =