中缀表达式转换为逆波兰表达式(C++)

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

#define STACK_INIT_SIZI 20
#define STACKINCREMENT  10

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

void InitStack(sqStack *s)
{
s->base = (ElemType*)malloc(STACK_INIT_SIZI*sizeof(ElemType));
if(!s->base)
{
exit(0);
}

s->top = s->base;
s->stackSize = STACK_INIT_SIZI;
}

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++;
}

//e作为返回值
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;
char c, e;

InitStack(&s);

printf("请输入中缀表达式,以#作为结束标志");
scanf("%c", &c);

while(c != '#')
{
while(c>='0' && c<='9')//使得10这样连续的数字直接输出
{
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出错:输入格式错误!");
}
scanf("%c" ,&c);
}
while(StackLen(s))
{
Pop(&s, &e);
printf("%c ", e);
}
printf("\n");
return 0;
}