数据结构之逆波兰表达式的用法

//逆波兰表达式：将中缀表达式转换为后缀表达式

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

#define STACK_INIT_SIZE 20
#define STACKINCREAMENT 10

typedef char ElemType;

//栈结构
typedef struct {
	ElemType* base;
	ElemType* top;
	int stackSize;
}sqStack;


//栈的初始化
void InitStack(sqStack* s) {
	s->base = (ElemType*)malloc(STACK_INIT_SIZE * sizeof(ElemType));
	if (!s->base)
		exit(0);
	s->top = s->base;
	s->stackSize = STACK_INIT_SIZE;
}


//压栈操作
void Push(sqStack* s, ElemType n) {
	if (s->top - s->base >= s->stackSize)
	{
		s->base = realloc(s->base, ((s->stackSize + STACKINCREAMENT) * sizeof(ElemType)));
	}
	if (!s->base)
		exit(0);
	*s->top = n;
	s->top++;
}


//弹栈操作
void Pop(sqStack* s, ElemType* n) {
	if (!s->base)
		exit(0);
	if (s->top == s->base)
		return;
	*n = *--(s->top);
}

//求栈当前容量
int StackLen(sqStack s) {

	return (s.top - s.base);
}

//主入口
int main(void) {
	sqStack s;
	char c, e;
	InitStack(&s);
	printf("请输入中缀表达式，以#作为结束标志：");
	scanf("%c", &c);
	while (c != '#') {
		while(c >= '0' && c <= '9') {
			printf("%c", c);
			scanf("%c", &c);
			if (c < '0' || c>'9')
				printf(" ");
		}
		if (')' == c) {
			Pop(&s, &e);
			while (e != '(') {
				printf("%c ", e);
				Pop(&s, &e);
			}
		}
		else if (c == '+' || c == '-') {
			if (!StackLen(s)) {
				Push(&s, c);
			}
			else {
				do {
					Pop(&s, &e);
					if ('(' == e) {
						Push(&s, e);
					}
					else
						printf("%c ", e);
				} while (StackLen(s) && e != '(');
				Push(&s, c);
			}
		}
		else if (c == '*' || c == '/' || c == '(') {
			Push(&s, c);
			if (!StackLen(s)) {
				Push(&s, c);
			}
		}
		else if (c == '#')
			break;
		else 
        {
		printf("输入有误！");
		return -1;
		}
		scanf("%c", &c);
				}
while (StackLen(s)) {
	Pop(&s, &e);
	printf("%c ", e);
}
     return 0;
}
	

小白的数据结构自学笔记。