#include "stdio.h"
#include "malloc.h"
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
#define OVERFLOW -1
#define ERROR 0
#define OK 1
typedef int SElemType;
typedef int Status;
typedef struct{
SElemType *base;
SElemType *top;
int stacksize;
}SqStack;
//插入栈
Status InitStack(SqStack &S)
{
S.base=(SElemType *)malloc(STACK_INIT_SIZE * sizeof(SElemType));
if(!S.base)return (OVERFLOW);
S.top=S.base;
S.stacksize=STACK_INIT_SIZE;
return OK;
}
Status GetTop(SqStack S,SElemType &e)
{//若栈不空,则用e返回S的栈顶元素,并返回OK;否则返回ERROR
if(S.top==S.base)return ERROR;
e=*(S.top-1);
return OK;
}
Status Push(SqStack &S,SElemType e)
{if(S.top-S.base>=S.stacksize)
{//栈满,追加存储空间
S.base=(SElemType *)realloc(S.base,(S.stacksize+STACKINCREMENT)*sizeof(SElemType));
if(!S.base)return (OVERFLOW);
S.top=S.base+S.stacksize;
S.stacksize+=STACKINCREMENT;
}
*S.top++=e;
return OK;
}
Status Pop(SqStack &S,SElemType &e)
{
if(S.top==S.base)return ERROR;
e=*--S.top;
return OK;
}
main()
{ SqStack S;
InitStack(S);
int e,i,m,top;
printf("请输入栈长:");
scanf("%d",&m);
printf("请输入栈的元素:");
for(i=0;i<m;i++)
{ scanf("%d",&e);
Push(S,e);
}
GetTop(S,top);
printf("栈顶元素为:%d/n",top);
//删除栈顶元素,返回新的栈顶
Pop(S,top);
GetTop(S,top);
printf("删除栈顶元素,并返回新的栈顶元素%d/n",top);
//插入新栈元素
return 0;
}