数据结构之表达式求值（用链式栈实现）

#include<stdio.h>
#include<stdlib.h>
#define Stack_Init_Size 100 //栈容量
#define StackIncrement 10 //栈增量
#define OVERFLOW -1
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
typedef int Status;
typedef char SElemType;
typedef int Status;
typedef struct SNode {
	SElemType data;
	struct  SNode* next;
}SNode, * LinkStack;
LinkStack InitStack()//注意这个初始化方式！！！！！！
{
	LinkStack s = (SNode*)malloc(sizeof(SNode));
	if (!s)
		exit(OVERFLOW);
	s->next = NULL;
	return s;
}
void Push(LinkStack s, SElemType e)
{
	LinkStack p = (SNode*)malloc(sizeof(SNode));
	if (p == NULL)
		exit(OVERFLOW);
	p->data = e;
	p->next = NULL;
	p->next = s->next;
	s->next = p;//与单链表的头插法相似
}
SElemType Pop(LinkStack s)
{
	LinkStack q;
	q = s->next;
	SElemType e = q->data;
	s->next = q->next;
	free(q);//删除单链表的第一个元素
	return e;
}
void DestroyStack(LinkStack s)
{
	free(s);
}
void ClearStack(LinkStack s)
{
	s->next = NULL;
}
Status StackEmpty(LinkStack s)
{
	if (s->next == NULL)
		return TRUE;
	else
	{
		return FALSE;
	}
}
int StackLength(LinkStack s)
{
	int i = 0;
	SNode* p = s->next;
	while (p != NULL)
	{
		i++;
		p = p->next;
	}
	return i;
}
SElemType GetTop(LinkStack l)
{
	return l->next->data;
}
void StackTravers(LinkStack s)
{
	SNode* p = s->next;
	while (p != NULL)
	{
		printf("%d ", p->data);
		p = p->next;
	}
}
int In(char e)//判断读入字符是否为运算符 
{
	if (e == '+' || e == '-' || e == '*' || e == '/' || e == '(' || e == ')' || e == '#')
		return 1;//是 
	else
		return 0; //不是 
}
char Precede(char a, char b)//比较运算符的优先级 
{
	char f;
	if (a == '+' || a == '-')
	{
		if (b == '+' || b == '-' || b == ')' || b == '#')
			f = '>';
		else if (b == '*' || b == '/' || b == '(')
			f = '<';
	}
	else if (a == '*' || a == '/')
	{
		if (b == '+' || b == '-' || b == '*' || b == '/' || b == ')' || b == '#')
			f = '>';
		else if (b == '(')
			f = '<';
	}
	else if (a == '(')
	{
		if (b == '+' || b == '-' || b == '*' || b == '/' || b == '(')
			f = '<';
		else if (b == ')')
			f = '=';
	}
	else if (a == ')')
	{
		if (b == '+' || b == '-' || b == '*' || b == '/' || b == ')' || b == '#')
			f = '>';
	}
	else if (a == '#')
	{
		if (b == '+' || b == '-' || b == '*' || b == '/' || b == '(')
			f = '<';
		else if (b == '#')
			f = '=';
	}
	return f;
}
char Operate(char a, char theta, char b)//运算 
{
	char c;
	a = a - '0';
	b = b - '0';
	if (theta == '+')
		c = a + b + '0';
	else if (theta == '-')
		c = a - b + '0';
	else if (theta == '*')
		c = a * b + '0';
	else if (theta == '/')
		c = a / b + '0';
	return c;
}
int EvaluateExpression()
{
	LinkStack OPTR=InitStack();//寄存运算符
	Push(OPTR, '#');
	LinkStack OPND = InitStack();//寄存操作数和运算结果
	char ch, a, b, theta, x;
	ch = getchar();
	while (ch != '#' || GetTop(OPTR) != '#')
	{
		if (!In(ch))//如果不是运算符
		{
			Push(OPND, ch);
			ch = getchar(); 
		}
		else//如果是运算符
		{
			switch (Precede(GetTop(OPTR),ch))//比较运算符的优先级
			{
			case '<':
				Push(OPTR, ch);//刚输入的运算符优先级更高，则运算符入栈
				ch = getchar();
				break;
			case '>': //刚输入的运算符优先级更低，则进行一次运算
				theta = Pop(OPTR);//原来栈里的运算符出栈
				b = Pop(OPND);
				a = Pop(OPND);//取出两个运算数
				Push(OPND, Operate(a, theta, b));
				break;
			case '=': //输入运算符的优先级相等
				x = Pop(OPTR);
				ch = getchar();
				break;
			}
		}
	}
	return GetTop(OPND) - '0';
}
int main()
{
	printf("请输入算数表达式，以#结束\n");
	printf("例如\t 1*(2-1)# \t\n");
	printf("运行结果是：%d\n", EvaluateExpression());
}

参考链接：
https://blog.csdn.net/qq_41152351/article/details/83046356