逆波兰表达式

计算机在进行数据运算时是如何知道运算优先级的 逆波兰表达式可以准确模拟这个过程，如（5+4）*2转换为逆波兰表达式就是 5 4 + 2 *
输入数据时遇到数字就进栈 遇到运算符时就弹栈两次进行运算 把运算结果入栈 这样就得到了最终的结果

源代码

include ‘’stdio.h‘’

include ‘’stdlib.h‘’

include ‘’ctype.h‘’

define Stack_init_size 100

define Stackincrease 10

define MaxBuffer 10

typedef int status;
typedef double elemtype;
typedef struct {
elemtype *base;
elemtype *top;
int stacksize;
}Sqstack;
//初始化栈
status initstack(Sqstack &S){
S.base = (elemtype*)malloc(Stack_init_size*sizeof(elemtype));
if(!S.base) exit(0);
S.top = S.base;
S.stacksize = Stack_init_size;
return 1;
}
//入栈
status push(Sqstack &S,elemtype e){
//空间不够追加空间
if(S.top - S.base >= S.stacksize){
S.base = (elemtype*)realloc(S.base,(Stackincrease + Stack_init_size)*sizeof(elemtype));
if(!S.base) exit(0);
S.top = S.base + S.stacksize;
S.stacksize += Stackincrease;
}
*S.top = e;
S.top ++;
return 1;
}
//出栈
status pop(Sqstack &S,elemtype &e) {
if(S.top == S.base) return 0;
e = *–S.top;
return 1;
}
//判断空栈
status stackempty(Sqstack S){
if(S.top == S.base) return 1;
return 0;
}
int main()
{
Sqstack S;
char c,str[MaxBuffer];
int i = 0;
double d,e;
initstack(S);
printf(“输入数字以空格隔开 以#结束\n”);
scanf(“%c”,&c);
while(c != ‘#’)
{
while(isdigit(c)||c == ‘.’)//过滤数字
{
str[i++] = c;
str[i] = ‘\0’;//很重要
if(i >= 10)
{
printf(“数据过大 重新输入”);
return -1;
}
scanf(“%c”,&c);
if(c == ’ ‘)
{
d = atof(str);//字符串转换为浮点数
push(S,d);
i = 0;
break;
}
}
switch(c)
{
case ‘+’:
pop(S,e);
pop(S,d);
push(S,d+e);
break;
case ‘-‘:
pop(S,e);
pop(S,d);
push(S,d-e);
break;
case ‘*’:
pop(S,e);
pop(S,d);
push(S,d*e);
break;
case ‘/’:
pop(S,e);
pop(S,d);
if(e != 0)
push(S,d/e);
else
{
printf(“除数不能为0”);
return -1;
}
break;
}
scanf(“%c”,&c);
}
pop(S,e);
printf(“最终计算结果为(保留两位小数) %.2f”,e);
return 1;
}