#include <stdio.h>
#include <Stdlib.h>
typedef struct node
{
int data;
struct node *pNext;
}NODE,*PNODE;
typedef struct Stack
{
PNODE pTop;
PNODE pBottom;
}STACK,* PSTACK;
void init(PSTACK pS)
{
pS->pTop=(PNODE)malloc(sizeof(NODE));
if(!pS->pTop)
exit(0);
pS->pBottom=pS->pTop;
pS->pTop->pNext=NULL;
}
void push(PSTACK pS,int val)
{
PNODE pNew=(PNODE)malloc(sizeof(NODE));
pNew->data=val;
pNew->pNext=pS->pTop;
pS->pTop=pNew;
}
void traverse(PSTACK pS)
{
PNODE p=pS->pTop;
while(p!=pS->pBottom)
{
printf("%d ",p->data);
p = p->pNext;
}
printf("\n");
}
int empty(PSTACK pS)
{
if (pS->pTop==pS->pBottom)
{
return 0;
}
else
return 1;
}
int pop(PSTACK pS,int * pVal)
{
if(empty(pS)==0)
return 0;
else
{// return true;
PNODE r =pS->pTop;
*pVal = r->data;
pS->pTop=r->pNext;
free(r);
r=NULL;
return 1;
}
}
int main()
{
STACK S;
int val;
init(&S);
push(&S,1);
push(&S,2);
push(&S,23);
push(&S,43);
push(&S,9);
pop(&S,&val);
traverse(&S);
if (pop(&S,&val)==1)
{
/* code */
printf("success! %d\n",val);
}
else
printf("FAil\n");
traverse(&S);
return 0;
}
链栈2
最新推荐文章于 2023-09-30 15:47:30 发布