栈的应用-----后缀表达式的计算

后缀表达式计算，给出的中缀表达式中有了#作为每个数字的结尾，则可以将多位数的数子字符转化为整型数字压入栈中；否则只能进行个位数的计算。

中缀表达式：9+(3-1)3+10/2
后缀表达式：9#3#1#-3#+10#2#/+
规则：

从做到右遍历后缀表达式的每个数字字符和符号字符
①. 如果是数字就进栈
②. 如果是符号，就将栈顶的两个数字出栈，第一个出栈的作为右操作数，第二个出栈的作为左操作数，将运算后的结果进栈
③. 到达末尾后将栈顶元素输出，即为表达式的结果

代码演示：

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

//栈存储的是整型，操作字符串时需要把字符转换成数字再进栈

# define ElemType int 

//定义栈结点类型
typedef struct StackNode
{
	ElemType data;
	struct StackNode* next;
}STACKNODE, *PSTACKNODE;

//定义栈类型
typedef struct Stack
{
	int size;
	struct StackNode * top;
}STACK, * PSTACK;

//压栈
void Push(PSTACK stack, ElemType e)
{
	PSTACKNODE newNode = (PSTACKNODE)malloc(sizeof(STACKNODE));
	if (stack == NULL || newNode == NULL)
	{
		return;
	}
	newNode->data = e;
	newNode->next = stack->top;
	stack->top = newNode;
	stack->size++;
	return;
}

//出栈
void Pop(PSTACK stack, ElemType *e)
{
	if (stack == NULL || stack->top == NULL)
	{
		return;
	}

	*e = stack->top->data;
	PSTACKNODE temp = stack->top->next;
	free(stack->top);
	stack->top = temp;
	stack->size--;
	return;
}

//初始化栈
PSTACK InitStack()
{
	PSTACK stack = (PSTACK)malloc(sizeof(STACK));
	stack->top = NULL;
	stack->size = 0;
	return stack;
}

//创建栈结点
PSTACKNODE creatStackNode(ElemType e)
{
	PSTACKNODE newNode = (PSTACKNODE)malloc(sizeof(STACKNODE));
	newNode->next = NULL;
	newNode->data = e;
	return newNode;
}

//计算
int Calculate(int a, int b, char c)
{
	switch (c)
	{
	case '+':
		return a + b;
		break;
	case '-':
		return a - b;
		break;
	case '*':
		return a * b;
		break;
	case '/':
		return a / b;
		break;
	default:
		break;
	}
	return 0;
}

int main(int argc, char* argv[])
{
	PSTACK stack = InitStack();

	char buff[100];
	scanf("%s", buff);
	getchar();

	int i;
	for (i = 0; i < strlen(buff); i++)
	{
		if (buff[i] >= '0' && buff[i] <= '9')
		{
			int temp = 0;
			while (buff[i] != '#')
			{
				temp = temp * 10 + (buff[i] - '0');
				i++;
			}
			Push(stack, temp);
		}
		else
		{
			int a, b, result;
			a = b = result = 0;
			Pop(stack, &a);
			Pop(stack, &b);
			//注意运算的顺序是b 运算符 a
			result = Calculate(b, a, buff[i]);
			Push(stack, result);
		}
	}

	int e;
	Pop(stack, &e);
	printf("%d\n", e);


	return 0;
}

输出结果：