CodeUp 堆栈队列 简单计算器

题目地址

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<string>
#include<stack>
#include<queue>
#include<map> 
using namespace std;
struct node
{
	double num;
	char op;
	bool flag; 
};
string str;
stack<node> s;		操作符栈 
queue<node> q;		/ 后缀表达式序列
map<char, int> op;  / 操作符优先级映射

void Change() ///中缀变后缀
{
	double num;
	node temp;
	for(int i = 0; i < str.length();)
	{
		if(str[i] >= '0' && str[i] <= '9')
		{
			temp.flag = true;
			temp.num = str[i++] - '0';
			更新多位操作数 
			while(i < str.length() && str[i] >= '0' && str[i] <='9')
			{
				temp.num = temp.num * 10 + (str[i] - '0');
				i++;
			}
			q.push(temp);
		}	
		else
		{
			temp.flag  = false;// 操作符
			while(!s.empty() && op[str[i]] <= op[s.top().op])
			{
				q.push(s.top());
				s.pop();
			} 
			temp.op = str[i];
			s.push(temp);
			i++; 
		} 	
	} 
	while(!s.empty())
	{
		q.push(s.top());
		s.pop();
	}
} 

double Cal() // 计算后缀表达式
{
	double temp1, temp2;
	node cur, temp;
	while(!q.empty())		//后缀表达式非空 
	{
		cur = q.front();
		q.pop();
		if(cur.flag == true)		///操作数则入栈 
			s.push(cur);
		else		///操作符则出栈计算 
		{
			temp2 = s.top().num;	///弹出第二操作数 
			s.pop();
			temp1 = s.top().num;	弹出第一操作数 
			s.pop();
			temp.flag = true;
			if(cur.op == '+')
				temp.num = temp1 + temp2;
			else if(cur.op == '-')
				temp.num = temp1 - temp2;
			else if(cur.op == '*') 
				temp.num = temp1 * temp2;
			else
				temp.num = temp1 / temp2;
			s.push(temp); 
		 } 
		
	}
	return s.top().num;
} 

int main()
{
	///设定操作符优先级 
	op['+'] = op['-'] = 1;
	op['*'] = op['/'] = 2;
	while(getline(cin,str), str != "0")
	{	
		///去除空格 
		for(string::iterator it = str.end(); it != str.begin(); it--)
		{
			if(*it == ' ')
				str.erase(it); 
		} 
		while(!s.empty())
			s.pop();
		Change();
		printf("%.2f\n", Cal());
	}
	
	return 0;
}