顺序栈

#include <iostream>
using namespace std;
#define stacksize 10
typedef struct             /*顺序栈*/
{
int stack[stacksize];
int top;            /*栈顶指针*/
}seqstack;
void initstack(seqstack *s)
{
s->top=-1;
}
int isempty(seqstack *s)
{
if(s->top==-1)
return 1;
return 0;
}
int Gettop(seqstack *s)
{
if(s->top==-1)
cout<<"空栈"<<endl;
else
cout<<s->stack[s->top]<<endl;
return 0;
}
int pushstack(seqstack *s,int num)
{
if(s->top>=stacksize-1)
cout<<"栈满"<<endl;
else
{
s->top++;
s->stack[s->top]=num;
}
}
void popstack(seqstack *s)
{
if(s->top==-1)
cout<<"空栈"<<endl;
else
s->top--;
}
void destroystack(seqstack *s)
{
s->top=0;
}
int main()
{
seqstack s;
initstack(&s);
pushstack(&s,1);
pushstack(&s,2);
Gettop(&s);
popstack(&s);
Gettop(&s);
return 0;
}