数据结构——中缀表达式转变成后缀表达式学习笔记

问题示例：如何将1+(2-3)*4+10/5 转换为后缀表达式 1 2 3 - 4 * + 10 5 / +这样的输出

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

#define STACK_INIT_SIZE 20
#define STACKINCREMENT 10
#define MAXBUFFER   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 e)
{
	
	if (s->top - s->base >= s->stackSize)
	{
		s->base = (ElemType *)realloc(s->base, (s->stackSize + STACKINCREMENT)* sizeof(ElemType));
		if (!s->base)
			exit(0);

		s->top = s->base + s->stackSize;
		s->stackSize = s->stackSize + STACKINCREMENT;
	}

	*(s->top) = e;
	s->top++;

}

void Pop(sqStack *s, ElemType *e)
{
	if (s->top == s->base)
		return;

	*e = *--(s->top); //将栈顶元素弹出并修改栈顶指针

}

int StackLen(sqStack s)
{
	return (s.top - s.base);
}

int main()
{
	sqStack s;
	ElemType 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);
		}
		else if ('#' == c)
		{
			break;
		}
		else
		{
			printf("输入错误，请重新输入!\n");
			return -1;
		}
		scanf("%c", &c);
	}

	while (StackLen(s))
	{
		Pop(&s, &e);
		printf("%c ", e);
	}
	system("pause");
	return 0;
}