中缀表达式转后缀表达式思路:
对于数字:直接输出
对于符号:
左括号:进栈
运算符号:与栈顶符号进行优先级比较
若栈顶符号优先级低,此符号进栈(默认栈顶若是左括号,左括号优先级最低)
若栈顶符号优先级高,将栈顶符号弹出并输出,之后进栈
右括号:将栈顶符号弹出并输出,直到匹配到左括号
遍历结束:将栈中所有符号弹出并输出
#include "linkstack.h"
int isNum(char c)
{
return '0' <= c && c <= '9';
}
int isLeft(char c)
{
return c == '(';
}
int isRight(char c)
{
return c == ')';
}
int isOperator(char c)
{
return (c == '+') || (c == '-') || (c == '*') || (c == '/');
}
int priority(char c)
{
int ret = 0;
if (c == '+' || c == '-')
{
ret = 1;
}
else if (c == '*' || c == '/')
{
ret = 2;
}
return ret;
}
void output(char c)
{
if (c != '\0')
{
printf("%c ",c);
}
}
void transform(const char* c)
{
LinkStack* stack = LinkStack_Create();
int i = 0;
char* result = NULL;
if (c == NULL)
{
return ;
}
while(c[i] != '\0')
{
if (isNum(c[i]))
{
output(c[i]);
}
else if (isOperator(c[i]))
{
while(priority(c[i]) <= priority((char)(int)LinkStack_Top(stack)))
{
output((char)(int)LinkStack_Pop(stack));
}
LinkStack_Push(stack,(void*)(int)c[i]);
}
else if (isLeft(c[i]))
{
LinkStack_Push(stack,(void*)(int)c[i]);
}
else if (isRight(c[i]))
{
while(!(isLeft((char)(int)LinkStack_Top(stack))))
{
output((char)(int)LinkStack_Pop(stack));
}
LinkStack_Pop(stack);
}
i++;
}
while(LinkStack_Size(stack) > 0 && c[i] == '\0')
{
output((char)(int)LinkStack_Pop(stack));
}
LinkStack_Destroy(stack);
}
int main()
{
printf("8 + (3 - 1) * 5 ==> ");
transform("8+(3-1)*5");
printf("\n");
system("pause");
return 1;
}
栈的实现见:https://blog.csdn.net/qq_33185566/article/details/103032974
输出结果: