最近上课需要做简单计算器,涉及到数据结构栈的应用,实现了字符串计算式中缀转后缀,并进行计算,写的可能有点乱,完全按自己思路写的。
#include<iostream>
using namespace std;
#include<vector>
#include<stack>
#include <sstream>
//判断是否为运算符号,是的话返回真
bool IsOperator(string c) {
if (c == "(" || c == ")" || c == "+" || c == "-" || c == "x" || c == "/") {
return true;
}
return false;
}
//重载输入为字符的情况
bool IsOperator(char c) {
if (c == '(' || c == ')' || c == '+' || c == '-' || c == 'x' || c == '/') {
return true;
}
return false;
}
//定义加减乘除运算
double calculateASMD(string s1, string s2, string s) {
//字符串转double
double num1, num2;
num1 = atof(s1.c_str());
num2 = atof(s2.c_str());
double result;
if (s == "+") {
result = num1 + num2;
}
else if (s == "-") {
result = num1 - num2;
}
else if (s == "x") {
result = num1 * num2;
}
else if (s == "/") {
result = num1 / num2;
}
return result;
}
//double类型转换成为string
string dou2str(double num)
{
stringstream ss; //stringstream需要sstream头文件
string str;
ss << num;
ss >> str;
return str;
}
//将字符串中数字和运算符分开放入vector容器
vector<string> convertFormula(string s) {
string str;
vector<string>temp;
//循环次数设置为字符串s的大小
for ( int i = 0; i < s.size(); i++)
{
if (IsOperator(s[i])) {
if (!str.empty()) {
temp.push_back(str);
str = "";
}
//存放运算符
str += s[i];
temp.push_back(str);
str = "";
}
else if (s[i] == '=') {
if (!str.empty()) {
temp.push_back(str);
str = "";
break;
}
}
else {
str += s[i];
}
}
if (!str.empty()) {
temp.push_back(str);
}
return temp;
}
//中缀转后缀
vector<string> InfixToPosfix(vector<string> v) {
//定义临时栈
stack<string>sTemp;
//定义后缀存储的vector容器
vector<string>vTemp;
//循环次数为v的大小
for (int i = 0; i < v.size(); i++) {
if (!IsOperator(v[i])) {
vTemp.push_back(v[i]);
}
//如果是运算符号,进行以下操作
else {
if (v[i] == "(" || sTemp.empty()) {
sTemp.push(v[i]);
}
else if (v[i] == "+" || v[i] == "-") {
if (sTemp.top() == "(") {
sTemp.push(v[i]);
}
else{
//如果栈顶元素优先级高于或等于加减
while (!sTemp.empty() && sTemp.top() != "(") {
vTemp.push_back(sTemp.top());
sTemp.pop();
}
sTemp.push(v[i]);
}
}
else if (v[i] == "x" || v[i] == "/") {
//如果栈顶元素优先级低于乘和除
if (sTemp.top() == "+" || sTemp.top() == "-" || sTemp.top() == "(") {
sTemp.push(v[i]);
}
else if (sTemp.top() == "x" || sTemp.top() == "/") {
//如果栈顶元素优先级高于或等于乘除
vTemp.push_back(sTemp.top());
sTemp.pop();
}
}
else if (v[i] == ")") {
//如果是右括号,将栈内运算符全部弹出,直至左括号
while (sTemp.top() != "(") {
vTemp.push_back(sTemp.top());
sTemp.pop();
}
//将左括号弹出
sTemp.pop();
}
}
}
//循环结束,将栈中剩余运算符依次取出
while (!sTemp.empty()) {
vTemp.push_back(sTemp.top());
sTemp.pop();
}
return vTemp;
}
//计算函数
double calculateFormula(vector<string> v) {
string str;
double num1, num2, numResult; //定义计算变量
vector<string>::iterator Num1;
vector<string>::iterator Num2;
vector<string>::iterator it = v.begin();//循环迭代器
//当vector容器中只剩一个元素时,结束循环
while(v.size() != 1){
if (IsOperator(*it)) {
//找到运算符前两个数字
Num1 = it - 2;
Num2 = it - 1;
numResult = calculateASMD(*Num1, *Num2, *it); //计算
str = dou2str(numResult); //将运算结果转回string
*Num1 = str; //将运算结果填到Num1位置
it = Num1;
Num1 = Num2 + 1;
v.erase(Num1);
v.erase(Num2);
}
it++;
}
return numResult;
}
int main()
{
//测试
string s;
vector<string>v;
cin >> s;
v = convertFormula(s);
v = InfixToPosfix(v);
double d = calculateASMD("2", "3", "x");
double d = calculateFormula(v);
system("pause");
return 0;
}