后缀表达式:不包含括号,运算符放在两个运算对象的后面,所有的计算按运算符出现的顺序,严格从左向右进行(不再考虑运算符的优先规则,如:(2 + 1) * 3 , 即2 1 + 3 *
计算后缀表达式,可以利用栈的特性,思路如下:
1. 如果读到数字,就将其入栈;
2. 如果读到运算符,弹出栈中的两个数字,并计算,再将计算的结果压入栈中;
3. 读到结尾后,弹出栈中元素就是计算的最终结果。
具体看代码实现
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include "stack.h"
bool profix_expression_is_operator(char str)
{
if('+'==str || '-'==str || '*'==str || '/'==str)
return true;
else
return false;
}
bool profix_expression_is_num(char str)
{
if('0'<=str && '9'>=str)
return true;
else
return false;
}
int profix_expression_calculate(int num1, int num2, char oper)
{
if('+' == oper)
return num1 + num2;
else if('-' == oper)
return num1 - num2;
else if('*' == oper)
return num1 * num2;
else if('/' == oper)
return num1 / num2;
return 0;
}
/* Insert the number into the Stack */
void profix_expression_in(STACK * stack, char * str)
{
int result=0, num1=0, num2=0;
if(true == profix_expression_is_num(*str))
{
stack_push(stack, atoi(str));
}
else if(true == profix_expression_is_operator(*str))
{
num2 = stack_pop(stack);
num1 = stack_pop(stack);
result = profix_expression_calculate(num1, num2, *str);
stack_push(stack, result);
}
}
/* Read the string and insert the number into stack */
void profix_expression_read(STACK * stack, char * str)
{
char *p = str;
while(*p != '\0')
{
if(' ' != *p)
{
profix_expression_in(stack, p);
}
p = p + 1;
}
printf("calculate result = %d\n", stack_pop(stack));
}
void profix_expression_main_test(void)
{
char string[] = "6 5 2 3 + 8 * + 3 + *"; // Infix is 6*(5+(2+3)*8 + 3)
//char string[] = "6 2 3 + * 2 /";
STACK * stack = stack_init();
printf("Standard is : %s\n", "6 * ( 5 + ( 2 + 3 ) * 8 + 3 )");
printf("Profix is : %s\n", string);
profix_expression_read(stack, string);
}
运行结果如下