#include "stdio.h"
#include "stdlib.h"
#include "io.h"
#include "math.h"
#include "time.h"
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define MAXSIZE 20 /* 存储空间初始分配量 */
typedef int status;
typedef int SElemType; /* SElemType类型根据实际情况而定,这里假设为int */
typedef struct StackNode
{
SElemType date;
struct StackNode *next;
}StackNode,*LinkStackPtr;
typedef struct
{
LinkStackPtr top;
int count;
}LinkStack;
status visit(SElemType c)
{
printf("%d ",c);
return OK;
}
status Push(LinkStack *S,SElemType e)
{
LinkStackPtr s=(LinkStackPtr)malloc(sizeof(StackNode));
s->date=e;
s->next=S->top;
S->top=s;
S->count++;
return 0;
}
status InitStack(LinkStack *S)
{
S->top=(LinkStackPtr)malloc(sizeof(StackNode));
if(!S->top)
return 0;
S->top=NULL;
S->count=0;
return 0;
}
status ClearStack(LinkStack *S)
{
LinkStackPtr p,q;
p=S->top;
while(p)
{
q=p;
p=p->next;
free(q);
}
S->count=0;
}
status StackEmpty(LinkStack S)
{
if(S.count==0)
return 1;
else
return 0;
}
status Pop(LinkStack *S,SElemType &e)
{
LinkStackPtr p;
if(StackEmpty(*S))
return 0;
e=S->top->date;
p=S->top;
S->top=S->top->next;
free(p);
S->count--;
return 1;
}
status Gettop(LinkStack *S,SElemType &e)
{
if(S->top==NULL)
return 0;
else
e=S->top->date;
return 1;
}
int StackLength(LinkStack S)
{
return S.count;
}
status stackTraverse(LinkStack S)
{
LinkStackPtr p;
p=S.top;
while(p)
{
visit(p->date);
p=p->next;
}
printf("\n");
return OK;
}
main()
{
int j;
LinkStack s;
int e;
if(!InitStack(&s))
for(j=1;j<=10;j++)
Push(&s,j);
printf("输出栈中元素");
stackTraverse(s);
printf("栈空否:%d(1表示空,0表示非空)\n",StackEmpty(s));
Gettop(&s,e);
printf("栈顶元素 e=%d 栈的长度为%d\n",e,StackLength(s));
ClearStack(&s);
printf("清空栈后,栈空否:%d(1:空 0:否)\n",StackEmpty(s));
getchar();
return 0;
}
栈的链式操作-------
最新推荐文章于 2024-07-25 14:35:46 发布