NYOJ 409表达式求值

花了一上午了写个模板，基本通用输入中缀式，后缀式，前缀式求值，而且输入中缀式还可输出前缀式和后缀式，只用注释掉不同的函数，就能基本AC简单的表达式求值题型。不清楚怎么用的留言，偶会说明一下 。。。

题目链接：http://acm.nyist.edu.cn/JudgeOnline/problem.php?pid=409

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<stack>
#include<cstdio>
#include<cstdlib>
using namespace std;

#define MAX 1005
#define CLR(arr) memset(arr,0,sizeof(arr))
struct nodes
{
	char num[10];
	int left,right;
	nodes()
	{
		CLR(num);
		left = right = 0;
	}
};
class EXP{
private:
	struct nodes node[MAX];
	char str[MAX],hstr[MAX],lstr[MAX]; //中序、前序、后序数组
	int pos,root,hlen,llen,val;
	double res;
public:
	EXP(char st[]); //中缀式
	int creat(int,int);
	void _pre(){cout<<hstr<<"=\n";} //输出前缀
	void _pos(){cout<<lstr<<"=\n";} //输出后缀
	void pre_print(int);//前序遍历
	void pos_print(int);//后序遍历
	double suffix(char st[]); //计算后缀表达式
	double result();
	double out() {return res;}
	~EXP(){}
};
EXP::EXP(char st[]){
	hlen = llen = val = 0;CLR(lstr); 
	pos = root = 0; CLR(hstr); CLR(str);
	strcpy(str,st); 
	root = creat(0,strlen(str)-2); //建树
	pre_print(root); pos_print(root);  //存储前缀、后缀式
	res = result(); //计算前缀式
	//strcpy(st,lstr);res = suffix(st);//计算后缀式
}
int EXP::creat(int b,int e){
	if(b > e) return 0;
	if(str[b] <= '9' && str[b] >= '0')
	{
		double res = 0; int n = 0;
		sscanf(&str[b],"%lf%n",&res,&n);
		if(b + n >= e)
		{
			sprintf(node[++pos].num,"%lf",res);
			node[pos].num[n] = '\0';
			return pos;
		}
	}
	int p = -1,cnt = 0,flag = 0;
	for(int i = b;i <= e;++i)
	{
		if(str[i] == '(')      cnt++;
		else if(str[i] == ')') cnt--;
		else if((str[i] == '+' || str[i] == '-') && !cnt){flag = 1; p = i;}
		else if((str[i] == '*' || str[i] == '/') && !cnt && !flag)  p = i;
	}
	if(p == -1) return creat(b+1,e-1);
	else 
	{
		node[++pos].num[0] = str[p];
		node[pos].num[1] = '\0';
		int v = pos;
		node[v].left = creat(b,p - 1);
		node[v].right= creat(p + 1,e);
		return v;
	}
}
void EXP::pre_print(int root){  //前序遍历
	sprintf(&hstr[hlen],"%s",node[root].num);
	hlen += strlen(node[root].num);hstr[hlen++] = ' ';
	//cout<<node[root].num;
	if(node[root].left) pre_print(node[root].left);
	if(node[root].right)pre_print(node[root].right);
}
void EXP::pos_print(int root){ //后序遍历
	if(node[root].left) pos_print(node[root].left);
	if(node[root].right)pos_print(node[root].right);
	//cout<<node[root].num;
	sprintf(&lstr[llen],"%s",node[root].num);
	llen += strlen(node[root].num);lstr[llen++] = ' ';
}
double EXP::result(){   //计算前缀式结果
	int n;
	double res = 0;
	switch(hstr[val])
	{
	case '+':val += 2;return result() + result();
	case '-':val += 2;return result() - result();
	case '*':val += 2;return result() * result();
	case '/':val += 2;return result() / result();
	case ' ':val += 2;return result();
	default:
		sscanf(&hstr[val],"%lf%n",&res,&n);
		val += n + 1; return res;
	}
}
double EXP::suffix(char st[]) //计算后缀式
{
	int p = 0;
	stack<char> opec; //操作符
	stack<double> oped;  //操作数
	double num1,num2;
	for(int i = 0;i < strlen(st) - 1;)
	{
		if(st[i] <= '9' && st[i] >= '0')
		{
			sscanf(&st[i],"%lf%n",&num1,&p);
			oped.push(num1); i += p;
		}
		else if(st[i] == ' ') i++;
		else 
		{
			num2 = oped.top(); oped.pop();
			num1 = oped.top(); oped.pop();
			switch(st[i])
			{
			case '+':num1 += num2;break;
			case '-':num1 -= num2;break;
			case '*':num1 *= num2;break;
			case '/':num1 /= num2;break;
			}
			i++;
			oped.push(num1);
		}
	}
	return oped.top();
}
int main()
{
	int T;
	char str[1005];
	scanf("%d",&T);
	while(T--)
	{
		CLR(str);
		getchar();
		scanf("%s",str);
		EXP exp(str);
	    exp._pre(); 
		exp._pos();
		printf("%.2lf\n",exp.out());
	}
	return 0;
}