鏈式棧代碼
#include <stdio.h>
#include <stdlib.h>
#define OK 1
#define ERROR 0
typedef int data_t;
typedef struct StackNode
{
data_t data;
struct StackNode *next;
}LinkStack;
LinkStack *CreateEmptyStack()//創建棧
{
LinkStack *s;
s = (LinkStack*)malloc(sizeof(LinkStack));
if(s==NULL)
{
perror("Create Empty Stack Error");
exit(0);
}
s->next=NULL;
return s;
}
int ClearLinkStack(LinkStack *stack)//清空棧
{
if(!stack)
return ERROR;
LinkStack *node;
while(stack->next!=NULL)
{
node=stack->next;
stack->next=node->next;
free(node);
}
return OK;
}
int DestroyLinkStack(LinkStack *stack)//銷燬棧
{
if(stack)
ClearLinkStack(stack);
free(stack);
stack=NULL;
return OK;
}
int EmptyLinkStack(LinkStack *stack)//判斷棧是否爲空
{
if(stack==NULL)
{
printf("Empty Error\n");
return -1;
}
else
{
return NULL==stack->next?OK:ERROR;
}
}
int PushStack(LinkStack *s,data_t e)//壓棧
{
if(s==NULL)
{
printf("PushStack Error\n");
return ERROR;
}
LinkStack *p=(LinkStack*)malloc(sizeof(LinkStack));
p->data=e;
p->next=s->next;
s->next=p;
return OK;
}
int PopStack(LinkStack *s,data_t *e)//彈棧
{
LinkStack *p;
if(s==NULL)
{
printf("PopStack Error\n");
return ERROR;
}
if(EmptyLinkStack(s)==OK)
{
printf("The Stack is Empty\n");
return ERROR;
}
*e=s->next->data;
p=s->next;
s->next=s->next->next;
free(p);
return OK;
}
int main()
{
/*
data_t data;
LinkStack *stack = CreateEmptyStack();
PushStack(stack,20);
PushStack(stack,30);
PopStack(stack,&data);
printf("Pop:%d\n",data);
PopStack(stack,&data);
printf("Pop:%d\n",data);
PopStack(stack,&data);
printf("Pop:%d\n",data);
PushStack(stack,20);
PushStack(stack,30);
if(DestroyLinkStack(stack)==OK)
{
printf("Desroy LinkStack Success\n");
}
return 0;
*/
}