用栈实现后缀表达式的计算:
①从左往右扫描下一个元素,直到处理完所有元素②若扫描到操作数则压入栈,并回到①;否则执行③
③若扫描到运算符,则弹出两个栈顶元素,执行相应运算,运算结果压回栈顶,回到①
#include<stdio.h>c
#include<malloc.h>
#define MaxSize 100
#define ElemType int
typedef struct Stack{
ElemType data[MaxSize];
int top;
}Stack;
void initStack(Stack* &S){
S = (Stack *)malloc(sizeof(Stack));
S->top=-1;
}
bool push(Stack * &S, ElemType e){
if(S->top == MaxSize - 1)
return false;
S->data[++S->top] = e;
return true;
}
bool pop(Stack * &S,ElemType &e){
if(S->top==-1)
return false;
e = S->data[S->top--];
return true;
}
bool getTop(Stack * &S, ElemType &e){
if(S->top==-1)
return false;
e = S->data[S->top];
return true;
}
bool emptyStack(Stack * &S){
return S->top==-1;
}
int getSymbolPriority(char c){
if(c=='+'||c=='-')
return 1;
else
return 2;
}
int main()
{
Stack *s;
char str[MaxSize];//后缀表达式
int result=0;
// scanf("%s",str);
gets(str);
initStack(s);
for(int i=0;str[i]!='\0';i++)
{
if(str[i]>='0' && str[i]<='9')
{
int e = str[i] - '0';
push(s,e);
}
else if(str[i]=='+' || str[i]=='-' || str[i]=='*' || str[i]=='/')
{
int e,e1,e2;
pop(s,e2);pop(s,e1);
switch(str[i])
{
case '+':e = e1+e2;push(s,e);break;
case '-':e = e1-e2;push(s,e);break;
case '*':e = e1*e2;push(s,e);break;
case '/':e = e1/e2;push(s,e);break;
default:break;
}
}
}
getTop(s,result);
printf("结果为:%d",result);
return 0;
}
//((9/(7-(2+2)))*3)-(2+(1+1))
//9722+-/3*211++-
//9 7 2 2 + - / 3 * 2 1 1 + + -
输入:
9 7 2 2 + - / 3 * 2 1 1 + + -
输出:
结果为:5
结果说明:
((9/(7-(2+2)))*3)-(2+(1+1))
=((9/(7-4))*3)-(2+2)
=((9/3)*3)-4
=9-4
=5