栈的方法逆波兰后缀表达式（来自小甲鱼数据结构系列）

#define  _CRT_SECURE_NO_WARNINGS
#include
#include
#include

#define STACK_INIT_SIZE 20
#define STACKINCREMENT  10
#define MAXBUFFER       10

typedef   double    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;
}

int Push(sqStack *s,ElemType e)
{
	if(s->top-s->base >= s->stackSize)
	{
		s->base=(ElemType*)realloc(s->base,(s->stackSize+STACKINCREMENT)*sizeof(ElemType));
		s->top=s->base+s->stackSize;
		s->stackSize=s->stackSize +STACKINCREMENT;
	}
	*(s->top)=e;
	s->top++;
	return 1;
}
int Pop(sqStack *s,ElemType *e)
{
	if(s->top==s->base)
		return 0;
	*e=*--(s->top);
	return 1;
}
int StackLen(sqStack s)
{
	return (s.top-s.base);
}


int main()
{
	sqStack s;
	char c;
	int i=0;;
	double d,e;
	char str[MAXBUFFER];
	InitStack(&s);
	printf("请按逆波兰表达式输入待计算数据，数据与运算符之间用空格隔开，以#符号结束\n");
	scanf("%c",&c);
	while(c!='#')
	{
		while(isdigit(c)||c=='.')
		{
			str[i++]=c;
			str[i]='\0';
			if(i>=10)
			{
				printf("出错：输入的单个数据过大！\n");
				return -1;
			}
			scanf("%c",&c);
			if(c==' ')
			{
				d=atof(str);
				Push(&s,d);
				i=0;
				break;
			}

		}
		switch (c)
		{
		case '+':
			Pop(&s,&e);
			Pop(&s,&d);
			Push(&s,d+e);
			break;
		case '-':
			Pop(&s,&e);
			Pop(&s,&d);
			Push(&s,d-e);
			break;
		case '*':
			Pop(&s,&e);
			Pop(&s,&d);
			Push(&s,d*e);
			break;
		case '/':
			Pop(&s,&e);
			Pop(&s,&d);
		//	Push(&s,d/e);
			if(e!=0)
			{
				Push(&s,d/e);
			}
			else
			{
				printf("\n出错：除数为0！\n");
			}
			break;

		}
		scanf("%c",&c);
	}
	Pop(&s,&d);
	printf("最终计算的结果为：%f\n",d);
	system("pause");
	return 0;
}