中缀表达式转后缀表达式并进行运算
可进行简单四则运算
#include<stdio.h>
#include<stdbool.h>
#include<stdlib.h>
#include<string.h>
typedef struct data {
int num;
char oper;
}Item;
typedef struct node {
Item item;
struct node* next;
}Node;
typedef struct {
Node* top;
Node* bottom;
int node_num;
}Stack;
bool InitStack(Stack* pstack);//初始化栈
bool StackIsEmpty(Stack* pstack);//判断栈是否为空
bool StackIsFull(Stack* pstack);//判断栈是否已满
bool PushStack_char(Stack* pstack, char oper);//进栈,运算符
bool PushStack_int(Stack* pstack, int num);//进栈,数字
bool PopStack(Stack* pstack);//出栈
char GetTop(Stack* pstack);//获取栈顶元素
bool PrintStack(Stack* pstack);//打印全体栈元素
bool FreeStack(Stack* pstack);//释放栈
bool ComOper(Stack* pstack, char ch);//运算符比较
void FunLz(Stack* ptemp, Stack* poper);//中缀转后缀
void InvertSeq(Stack* ptemp, Stack* pfinal);//逆序
void Compute(Stack* pfinal, Stack* pcom);//计算后缀表达式
bool InitStack(Stack* pstack)
{
pstack->node_num = 0;
pstack->top = (Node*)malloc(sizeof(Node));
pstack->bottom = NULL;
pstack->top->next = pstack->bottom;
if (pstack->bottom != NULL)
return false;
if (pstack->top->next != pstack->bottom)
return false;
return true;
}
bool StackIsEmpty(Stack* pstack)
{
bool empty = true;
if (pstack->node_num == 0)
return empty;
else return !empty;
}
bool StackIsFull(Stack* pstack)
{
bool full = true;
Node* ptemp;
ptemp = (Node*)malloc(sizeof(Node));
if (ptemp == NULL)
{
free(ptemp);
return full;
}
else
{
free(ptemp);
return !full;
}
}
bool PushStack_char(Stack* pstack, char oper)
{
Node* pnew;
pnew = (Node*)malloc(sizeof(Node));
if (pnew == NULL)
return false;
pnew->item.oper = oper;
if (StackIsEmpty(pstack) == true)
{
pnew->next = pstack->bottom;//新节点指向栈底
pstack->top = pnew;//新节点变成栈顶
pstack->node_num++;//节点计数增加
return true;
}
if (StackIsEmpty(pstack) == false)
{
pnew->next = pstack->top;//新节点指向栈顶
pstack->top = pnew;//新节点变成“真”栈顶
pstack->node_num++;//节点计数增加
return true;
}
return false;
}
bool PushStack_int(Stack* pstack, int num)
{
Node* pnew;
pnew = (Node*)malloc(sizeof(Node));
if (pnew == NULL)
return false;
pnew->item.num = num;
pnew->item.oper = '=';//做一个标识
if (StackIsEmpty(pstack) == true)
{
pnew->next = pstack->bottom;//新节点指向栈底
pstack->top = pnew;//新节点变成栈顶
pstack->node_num++;//节点计数增加
return true;
}
if (StackIsEmpty(pstack) == false)
{
pnew->next = pstack->top;//新节点指向栈顶
pstack->top = pnew;//新节点变成“真”栈顶
pstack->node_num++;//节点计数增加
return true;
}
return false;
}
bool PopStack(Stack* pstack)
{
Node* ptemp;
if (StackIsEmpty(pstack) == true)
{
printf("栈空!无法出栈!\n");
return false;
}
else
{
ptemp = pstack->top;//临时节点保存栈顶
pstack->top = pstack->top->next;//栈顶向前推进
free(ptemp);//释放原栈顶
pstack->node_num--;//节点计数减少
return true;
}
}
char GetTop(Stack* pstack)
{
if (StackIsEmpty(pstack) == true)
{
printf("栈空!无法获取栈顶元素!\n");
return false;
}
else
return pstack->top->item.oper;
}
bool PrintStack(Stack* pstack)
{
Node* pscan = pstack->top;//获取当前栈顶
if (StackIsEmpty(pstack) == true)
{
printf("栈空!无法打印栈元素!\n");
return false;
}
else
{
printf("全体栈元素:");
while (pscan != NULL)
{
if (pscan->item.oper == '=')
printf("%d ", pscan->item.num);
else
printf("%c ", pscan->item.oper);
pscan = pscan->next;//向前
}
putchar('\n');
return true;
}
}
bool FreeStack(Stack* pstack)
{
Node* ptemp = pstack->top;//获取当前栈顶
if (StackIsEmpty(pstack) == true)
{
printf("栈空!无需释放!\n");
return false;
}
else
{
//栈顶非空时
while (ptemp != NULL)
{
pstack->top = pstack->top->next;//栈顶向前
free(ptemp);//释放原栈顶
ptemp = pstack->top;//保存当前栈顶
}
return true;
}
}
bool ComOper(Stack* pstack, char ch)
{
bool greater = true;
bool equal = false;
bool less = false;
if (ch == '*' || ch == '/')
{
if (GetTop(pstack) == '*' || GetTop(pstack) == '/')
return equal;
else
return greater;
}
else if (ch == '+' || ch == '-')
return less;
else
return false;
}
void FunLz(Stack* ptemp, Stack* poper)
{
char ch = '=', temp;
int n, num;
char num_char[10] ={'#'};
int i = 0;
bool flag = true;//用来判断最后中缀表达式最后一位是不是数字
do {
//进行输入
scanf_s("%c", &ch, (int)sizeof(char));
//if(ch != '=')
//printf("输入%c\n", ch);
//'='停止输入
if (ch == '=')break;
//为数字存入num字符数组
else if (ch >= '0' && ch <= '9')
{
flag = true;
num_char[i] = ch;
i++;
}
//为运算符时
else
{
flag = false;
//没有输入过数字不能进行以下操作
if (num_char[0] != '#')
{
num_char[i] = '\0';//变成字符串
num = atoi(num_char);//字符串转数字
PushStack_int(ptemp, num);//数字入临时结果栈
//printf("%d进临时结果栈\n", num);
for (int n = 0; n < 10; n++)
num_char[n] = '#';
i = 0;
}
//如果 “运算符栈空” 或 “输入的为'('” 时,直接压入运算符栈
if (StackIsEmpty(poper) == true || ch == '(')
{
PushStack_char(poper, ch);
//printf("%c进运算符栈\n", ch);
}
//输入')'时
else if (ch == ')')
{
//到运算符栈顶元素为'('止
while (GetTop(poper) != '(')
{
temp = GetTop(poper);
PopStack(poper);
//printf("%c出运算符栈\n", temp);
PushStack_char(ptemp, temp);
//printf("%c进临时结果栈\n", temp);
}
PopStack(poper);//把'('出运算符栈
//printf("(出运算符栈\n");
}
//括号输入已经处理完毕
//运算符栈顶元素为'('
else if (GetTop(poper) == '(')
{
PushStack_char(poper, ch);
//printf("%c进运算符栈\n", ch);
}
else
{
//如果优先级高
if (ComOper(poper, ch) == true)
{
PushStack_char(poper, ch);
//printf("%c进运算符栈\n",ch);
}
//如果优先级低或相同
else
{
temp = GetTop(poper);
PopStack(poper);
//printf("%c出运算符栈\n", temp);
PushStack_char(ptemp, temp);
//printf("%c进临时结果栈\n", temp);
PushStack_char(poper, ch);//将输入的ch入栈
//printf("%c进运算符栈\n", ch);
}
}
}
/* if (StackIsEmpty(ptemp) == false)
{
printf("临时结果");
PrintStack(ptemp);
}
if (StackIsEmpty(poper) == false)
{
printf("运算符");
PrintStack(poper);
}
putchar('\n');*/
} while(ch != '=');
//当中缀表达式最后不是运算符时,最后一个数字要独立输出,如1+2
if (flag == true)
{
num_char[i] = '\0';//变成字符串
num = atoi(num_char);//字符串转数字
PushStack_int(ptemp, num);//数字入临时结果栈
//printf("%d进临时结果栈\n", num);
}
//处理剩余内容
while (getchar() != '\n')
continue;
//将运算符栈剩余内容压入临时结果栈
n = poper->node_num;
while (n--)
{
temp = GetTop(poper);
PopStack(poper);
//printf("%c出运算符栈\n", temp);
PushStack_char(ptemp, temp);
//printf("%c进临时结果栈\n", temp);
/* if (StackIsEmpty(ptemp) == false)
{
printf("临时结果");
PrintStack(ptemp);
}
if (StackIsEmpty(poper) == false)
{
printf("运算符");
PrintStack(poper);
}
putchar('\n');*/
}
}
void InvertSeq(Stack* ptemp, Stack* pfinal)
{
char temp_oper;
int temp_num;
while (StackIsEmpty(ptemp) == false)
{
if (GetTop(ptemp) == '=')
{
temp_num = ptemp->top->item.num;
PopStack(ptemp);
PushStack_int(pfinal, temp_num);
}
else
{
temp_oper = ptemp->top->item.oper;
PopStack(ptemp);
PushStack_char(pfinal, temp_oper);
}
}
}
void Compute(Stack* pfinal, Stack* pcom)
{
char temp_oper;
int temp_num;
int num[2] = { 0 };
printf("\n开始运算……\n");
while (StackIsEmpty(pfinal) == false)
{
//如果是数字
if (GetTop(pfinal) == '=')
{
temp_num = pfinal->top->item.num;
PopStack(pfinal);
PushStack_int(pcom, temp_num);
}
//如果是运算符
else
{
int i = 0;
temp_oper = pfinal->top->item.oper;
PopStack(pfinal);
//当运算栈节点数大于等于2时
if (pcom->node_num >= 2)
{
//将两个数字出栈准备进行运算
for (i = 0; i < 2; i++)
{
num[i] = pcom->top->item.num;
PopStack(pcom);
}
}
switch (temp_oper)//判断运算符
{
case'+':
temp_num = num[1] + num[0]; break;
case'-':
temp_num = num[1] - num[0]; break;
case'*':
temp_num = num[1] * num[0]; break;
case'/':
temp_num = num[1] / num[0]; break;
default:
temp_num = 0;
}
PushStack_int(pcom, temp_num);
}
}
printf("运算结果:%d\n", pcom->top->item.num);
}
int main()
{
Stack S1;//临时结果栈
Stack S2;//运算符栈
Stack S3;//最终结果栈
Stack S4;//运算栈
if (InitStack(&S1) && InitStack(&S2) && InitStack(&S3) && InitStack(&S4))
printf("程序运行……\n");
else
exit(1);
if (StackIsFull(&S1) == false && StackIsFull(&S2) == false)
FunLz(&S1, &S2);
else
exit(1);
/*if (StackIsEmpty(&S1) == false)
{
printf("临时结果");
PrintStack(&S1);
}*/
InvertSeq(&S1, &S3);
if (StackIsEmpty(&S3) == false)
{
printf("最终结果");
PrintStack(&S3);
}
Compute(&S3, &S4);
return 0;
}
注释为测试代码
本方法基于【C】【Stack】链栈实现中缀转后缀