#include<iostream>
using namespace std;
typedef int ElemType;
typedef struct Node
{
ElemType data;
Node *next;
}StackNode,*StackPtr;
typedef struct
{
StackPtr top;
}LinkStack;
void InitStack(LinkStack *s)
{
s->top = NULL;
}
int IsEmpty(LinkStack *s)
{
return s->top == NULL;
}
void Push(LinkStack *s,ElemType x)
{
StackPtr p = (StackPtr)malloc(sizeof(StackNode));
p->data = x;
p->next = s->top;
s->top = p;
}
void Pop(LinkStack *s)
{
if(s->top)
{
StackPtr p;
p = s->top;
s->top = p->next;
free(p);
}
else
cout<<"栈为空!"<<endl;
}
void GetTop(LinkStack *s)
{
if(s->top)
cout<< "栈顶元素为:"<<s->top->data<<endl;
else
cout<<"栈空!"<<endl;
}
void PrintStack(LinkStack *s)
{
if(s->top)
{
StackPtr p = s->top;
while(p)
{
cout<<p->data<<endl;
p = p->next;
}
}
else
cout<<"栈空!"<<endl;
}
int main()
{
LinkStack s;
LinkStack *m = &s;
InitStack(m);
for(int i = 0; i<5; i++)
Push(m,i);
PrintStack(m);
for(int i = 0; i<6; i++)
Pop(m);
PrintStack(m);
return 1;
}