#include<iostream.h>
#include<stdlib.h>
#define LINKSIZE 100
#define stackinrement 10
#define error 0
#define ok 1
typedef int elemtype;
typedef struct {
elemtype *base;
elemtype *top;
int stacksize;
}sqstack;
int Creat(sqstack &s)
{s.base=(elemtype *)malloc(LINKSIZE*sizeof(elemtype));
if(!s.base) return error;//存储分配失败
s.top=s.base;
s.stacksize=LINKSIZE;
return ok;
}
int Insert(sqstack &s, elemtype e)
{if(s.top-s.base>=s.stacksize)
{s.base=(elemtype*)realloc(s.base,(s.stacksize+stackinrement)*sizeof(elemtype)) ;
if(!s.base) return error;
s.top=s.base+s.stacksize;
s.stacksize+=LINKSIZE;
}
*s.top++=e;
return ok;
}
int Delete(sqstack &s,elemtype &e){
if(s.top==s.base)
return error;
e=*--s.top;
return ok;
}
int Putout(sqstack s)
{
int*p,e;
p=s.top-1 ;
if(s.top==s.base) return error;
cout<<"输出所有元素";
for(p;p>=s.base;p--)
{e=*p;
cout<<e<<" ";}
return ok;
}
int main()
{sqstack s;
int i,e;
Creat(s);
cout<<"输入元素:";
for(i=0;i<stackinrement;i++)
{
cin>>e;
Insert(s,e);
}
Putout(s);
cout<<"输入要插入的元素:";
cin>>e;
Insert(s,e);
Putout(s);
cout<<"删除栈顶元素之后:\n";
Delete(s,e);Putout(s);
cout<<endl;
return ok;
}