栈的应用-中缀转后缀表达式及其计算
中缀转后缀表达式及其计算是栈的另外一个典型应用,中缀表达式例如:8+(3-1)*5,这是我们习惯的表达方式,但是计算机不是这么算的,计算机首先把他转成后缀表达式,然后根据后缀表达式进行计算;
中缀转后缀表达式的算法流程
#include<iostream>
using namespace std;
#include"LinkStack.h"
int isNumber(char c)//判断是否是数字
{
return ('0' <= c) && (c <= '9');
}
int isoperator(char c)
{
return(c=='+')||(c=='-')||(c=='*')||(c=='/');
}
int isLeft(char c)//判断是否是左符号
{
return(c == '(');
}
int isRight(char c)//判断是否是右符号
{
return(c == ')');
}
int priority(char c)//判断优先级
{
int ret = 0;
if ((c == '+') || (c == '-'))
{
ret = 1;
}
if ((c == '*') || (c == '/'))
{
ret = 2;
}
return ret;
}
void output(char c)//输出表达式
{
if (c != '\0')
{
cout << c<<" ";
}
}
void transform(const char* exp)//中缀转后缀表达式
{
int i = 0;
LinkStack* Stack = LinkStack_Create();
while (exp[i] != '\0')
{
if (isNumber(exp[i]))
{
output(exp[i]);
}
else if (isoperator(exp[i]))
{
while ( priority(exp[i]) <= priority((char)(int)LinkStack_Top(Stack)))
{
output((char)(int)LinkStack_Pop(Stack));
}
LinkStack_Push(Stack, (void*)(int)exp[i]);
}
else if (isLeft(exp[i]))
{
LinkStack_Push(Stack, (void*)(int)exp[i]);
}
else if (isRight(exp[i]))
{
while (!isLeft((char)(int)LinkStack_Top(Stack)))
{
output((char)(int)LinkStack_Pop(Stack));
}
LinkStack_Pop(Stack);
}
else
{
cout << "invalid expression" << endl;
break;
}
i++;
}
while ((LinkStack_Size(Stack) > 0) && (exp[i] == '\0'))
{
output((char)(int)LinkStack_Pop(Stack));
}
LinkStack_Destroy(Stack);
}
int* value(char c)//将数字符号转换为数字
{
int* tmp=(int*)malloc(sizeof(int));
*tmp = c - '0';
return tmp;
}
int express(int left, int right, char c)//计算每个符号的左右操作数在操作符的作用下的计算结果
{
int tmp = 0;
switch (c)
{
case'+':
tmp = left + right;
break;
case'-':
tmp = left - right;
break;
case'*':
tmp = left * right;
break;
case'/':
tmp = left / right;
}
return tmp;
}
int compute(const char* exp)//后缀表达式的计算过程
{
LinkStack* Stack = LinkStack_Create();
int ret = 0;
int i = 0;
while (exp[i]!='\0')
{
if (isNumber(exp[i]))
{
LinkStack_Push(Stack, (void*)value(exp[i]));
cout<<*(int *)LinkStack_Top(Stack);
}
else if (isoperator(exp[i]))
{
int right = *(int*)LinkStack_Pop(Stack);
int left = *(int*)LinkStack_Pop(Stack);
int result = express(left, right, exp[i]);
LinkStack_Push(Stack, (void*)&(result));
}
else
{
cout << "invalid expression" << endl;
break;
}
i++;
}
if ((LinkStack_Size(Stack) == 1) && (exp[i] == '\0'))
{
ret=*(int*)LinkStack_Pop(Stack);
}
return ret;
}
int main()
{
transform("8+(3-1)*5");
cout << endl;
int result= compute("831-5*+");
cout << endl;
cout << result;
return 0;
}
运算结果