#include <iostream>
#include <malloc.h>
#include <stdlib.h>
using namespace std;
typedef struct Node{
int data;
Node * pNext;
}NODE,*PNODE;
typedef struct Stack{
PNODE pTop;
PNODE pBottom;
}STACK,* PSTACK;
void init(PSTACK p){
PNODE tmp=(PNODE)malloc(sizeof(NODE));
if (tmp==NULL){
cout<<"错误"<<endl;
exit(-1);
}
p->pBottom=tmp;
p->pTop=tmp;
p->pTop->pNext=NULL;
}
bool push(PSTACK p,int data){
PNODE pnode = (PNODE)malloc(sizeof(NODE));
pnode->data=data;
pnode->pNext=p->pTop;
p->pTop=pnode;
return true;}
void traverse(PSTACK p){
PNODE t=p->pTop;
while (t!=p->pBottom){
cout<<t->data<<",";
t=t->pNext;
}
return;
}
bool isempty(PSTACK p){
if(p->pTop==p->pBottom){
return true;
}else return false;
}
int pop(PSTACK p){
PNODE tmp;
int i;
if (!isempty(p)){
tmp=p->pTop;
i=tmp->data;
p->pTop=p->pTop->pNext;
free(tmp);
}else{
exit(-1);
}
return i;
}
int main() {
STACK S;
init(&S);
push(&S,1);
push(&S,2);
push(&S,3);
push(&S,4);
traverse(&S);
cout<<pop(&S);
cout<<pop(&S);
cout<<"删除之后"<<endl;
traverse(&S);
return 0;
}