#include <stdio.h>
#include <malloc.h>
#include <ctype.h>
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
#define OVERFLOW -1
#define ERROR -1
#define OK 1
typedef int SElemType ;
typedef struct{
SElemType *base;
SElemType *top;
int stacksize;
}SqStack;
int InitStack(SqStack *S)//构建一个空栈
{
S->base =(SElemType *)malloc(STACK_INIT_SIZE * sizeof(SElemType));
if(!S->base)
return ERROR;
S->top =S->base ;
S->stacksize = STACK_INIT_SIZE;
return OK;
}
int GetTop(SqStack S,SElemType e)//若栈不空,则用e返回S的栈顶元素,并返回OK;否则返回ERROR
{
if(S.top==S.base) return ERROR;
e=*(S.top-1);
return OK;
}
int Push(SqStack &S,SElemType e)//插入e为新的栈顶元素
{
if(S.top-S.base>=S.stacksize)
{
S .base=(SElemType*)realloc(S.base,(S.stacksize+STACKINCREMENT)*sizeof(SElemType));
if(!S.base)
return ERROR;
S.top=S.base+S.stacksize;
S.stacksize+=STACKINCREMENT;
}
*S.top++=e;
return OK;
}
int Pop(SqStack &S,SElemType &e)//若栈不空,则删除S的栈顶元素,用e返回其值,并返回OK;否则返回ERROR
{
if(S.base==S.top)
return ERROR;
e=*--S.top;
return OK;
}
int Operate(int a,char p,int b)//栈顶弹出两个数字,判断当前的符号并进行计算
{
switch(p)
{
case '+':return a+b;break;
case '-':return a-b;break;
case '*':return a*b;break;
case '/':return a/b;break;
default:break;
}
}
#include <malloc.h>
#include <ctype.h>
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
#define OVERFLOW -1
#define ERROR -1
#define OK 1
typedef int SElemType ;
typedef struct{
SElemType *base;
SElemType *top;
int stacksize;
}SqStack;
int InitStack(SqStack *S)//构建一个空栈
{
S->base =(SElemType *)malloc(STACK_INIT_SIZE * sizeof(SElemType));
if(!S->base)
return ERROR;
S->top =S->base ;
S->stacksize = STACK_INIT_SIZE;
return OK;
}
int GetTop(SqStack S,SElemType e)//若栈不空,则用e返回S的栈顶元素,并返回OK;否则返回ERROR
{
if(S.top==S.base) return ERROR;
e=*(S.top-1);
return OK;
}
int Push(SqStack &S,SElemType e)//插入e为新的栈顶元素
{
if(S.top-S.base>=S.stacksize)
{
S .base=(SElemType*)realloc(S.base,(S.stacksize+STACKINCREMENT)*sizeof(SElemType));
if(!S.base)
return ERROR;
S.top=S.base+S.stacksize;
S.stacksize+=STACKINCREMENT;
}
*S.top++=e;
return OK;
}
int Pop(SqStack &S,SElemType &e)//若栈不空,则删除S的栈顶元素,用e返回其值,并返回OK;否则返回ERROR
{
if(S.base==S.top)
return ERROR;
e=*--S.top;
return OK;
}
int Operate(int a,char p,int b)//栈顶弹出两个数字,判断当前的符号并进行计算
{
switch(p)
{
case '+':return a+b;break;
case '-':return a-b;break;
case '*':return a*b;break;
case '/':return a/b;break;
default:break;
}
}