3-2 求前缀表达式的值(25 分)
算术表达式有前缀表示法、中缀表示法和后缀表示法等形式。前缀表达式指二元运算符位于两个运算数之前,例如
2+3*(7-4)+8/4
的前缀表达式是:+ + 2 * 3 - 7 4 / 8 4
。请设计程序计算前缀表达式的结果值。
输入格式:
输入在一行内给出不超过30个字符的前缀表达式,只包含
+
、-
、*
、\
以及运算数,不同对象(运算数、运算符号)之间以空格分隔。
输出格式:
输出前缀表达式的运算结果,保留小数点后1位,或错误信息
ERROR
。
输入样例:
+ + 2 * 3 - 7 4 / 8 4
输出样例:
13.0
序号 输入 输出
1
+ + 2 * 3 - 7 4 / 8 4
13.0
2
/ -25 + * - 2 3 4 / 8 4
12.5
3
/ 5 + * - 2 3 4 / 8 2
ERROR
4
+10.23
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int judgeSymbol(char symbol)
{
int answer = 317;
switch (symbol)
{
case '+':
answer = 1; break;
case '-':
answer = 2; break;
case '*':
answer = 3; break;
case '/':
answer = 4; break;
default:
break;
}
return answer;
}
int main(int argc, char **argv)
{
int i = 0;
double mathsAnswer[21] = { '\0' };
char problem[71] = { '\0' };
int judge = 666;
gets(problem);
int j = 0;
int len = strlen(problem);
for (i = len - 1; i >= 0; i--)
{
if (problem[i] == ' ')
continue;//当读取到空格时,抛弃空格
else if (problem[i] >= '0'&&problem[i] <= '9')
{//寻找下一个空格或者i==0的地方
while (1)
{
if (i == 0 || problem[i] == ' ')
break;
i--;
}
if(i==0)
mathsAnswer[j++] = atof(&problem[i]);
else
{
i++;
mathsAnswer[j++] = atof(&problem[i]);
}
}
else
{
judge = judgeSymbol(problem[i]);
if (judge == 1)
{
j--;
mathsAnswer[j - 1] = mathsAnswer[j - 1] + mathsAnswer[j];
mathsAnswer[j] = '\0';//清空栈顶以上的垃圾值
}
else if (judge == 2)
{
j--;
mathsAnswer[j - 1] = mathsAnswer[j] - mathsAnswer[j - 1];
mathsAnswer[j] = '\0';//清空栈顶以上的垃圾值
}
else if (judge == 3)
{
j--;
mathsAnswer[j - 1] = mathsAnswer[j] * mathsAnswer[j - 1];
mathsAnswer[j] = '\0';//清空栈顶以上的垃圾值
}
else if (judge == 4)
{
j--;
if (mathsAnswer[j-1] == 0)
{
printf("ERROR");
return 0;
}
mathsAnswer[j - 1] = mathsAnswer[j] / mathsAnswer[j - 1];
mathsAnswer[j] = '\0';//清空栈顶以上的垃圾值
}
judge = 666;
}
}
if ( mathsAnswer[1] != '\0')
printf("ERROR");
else
printf("%.1f\n", mathsAnswer[0]);
return 0;
}