利用链栈数据结构实现一组数据的存储,并通过简单的交互实现入栈和出栈
//ADT 栈(Stack) 链式存储结构 LinkStack
#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 50
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
typedef int ElemType;
typedef int Status;
//链栈结点的定义
typedef struct StackNode
{
ElemType data;
struct StackNode *next; //结点的指针域用于指向后继元素,跟链表中的指针域使用一样
} StackNode;
typedef struct StackNode *LinkStackPtr;
//链栈的定义
typedef struct LinkStack
{
LinkStackPtr top; //定义栈结点结构体指针,用于栈顶指针的作用
int count; //记录链栈的长度
} LinkStack;
//链栈的初始化
Status InitStack(LinkStack *S)
{
S->top = (LinkStackPtr)malloc(sizeof(StackNode)); //创建第一个结点
S->top->next = NULL; //初始第一个栈结点的指针域
S->top->data = 0; //初始化第一个栈的结点的数据域
S->count = 0; //初始化链栈的长度
return OK;
}
//判断链栈是否初始化成功
Status StackEmpty(LinkStack S)
{
if (S.count == 0)
return TRUE;
else
return FALSE;
}
//清空链栈
Status ClearStack(LinkStack *S)
{
LinkStackPtr p = NULL;
LinkStackPtr q = NULL;
p = S->top;
while (p)
{
q = p;
p = p->next;
free(q);
}
S->count = 0;
return OK;
}
//查询数据元素个数
Status StackLength(LinkStack S)
{
return S.count;
}
//链栈的取值,只能取出栈顶的数据元素的值
Status GetTop(LinkStack S, ElemType *e)
{
if (S.count == 0)
return ERROR;
else
*e = S.top->data;
return OK;
}
//链栈的插入
Status Push(LinkStack *S, ElemType e)
{
LinkStackPtr p = (LinkStackPtr)malloc(sizeof(StackNode));
p->next = S->top; //将新结点的指针域指向后继元素地址,即插入之前的栈顶元素地址
p->data = e;
S->top = p; //将栈顶指针指向现在的栈顶元素的地址
S->count++;
return OK;
}
//链栈的删除
Status Pop(LinkStack *S, ElemType *e)
{
LinkStackPtr p = NULL;
if (S->count == 0)
return ERROR;
*e = S->top->data;
p = S->top;
S->top = S->top->next; //将栈顶指针指向栈顶元素的后继元素,作为新的栈顶元素
free(p);
S->count--;
return OK;
}
//链栈的数据输入,只能从栈顶入栈
Status CreateElem(LinkStack *S)
{
int a = 0;
LinkStack *s = S;
printf("请输入一组整型数据:");
scanf("%d", &a);
s->top->data = a; //将数据存入初始化时创建的第一个栈结点数据域中
s->count++;
while (TRUE)
{
LinkStackPtr p = NULL;
scanf("%d", &a);
char c = getchar();
p = (LinkStackPtr)malloc(sizeof(StackNode));
p->data = a;
p->next = s->top; //将新结点的指针域指向上一个栈顶元素的地址,即现在的后继元素地址
s->top = p; //将栈顶指针指向下一个结点
s->count++; //链栈长度加一
if (c == '\n') //输入以回车符结束
break;
}
return OK;
}
//链栈主函数
int main()
{
LinkStack S;
ElemType e;
Status i;
printf("链栈自动初始化中......\n");
i = InitStack(&S);
i = StackEmpty(S);
if (i == 1)
printf("链栈初始化成功\n");
else
printf("链栈初始化失败\n");
i = CreateElem(&S);
if (i == 1)
printf("数据元素存储成功,链栈的长度为%d\n", S.count);
else
printf("数据元素存储失败\n");
while (TRUE)
{
int a = 0;
printf("请选择要进行的操作:\n1:查询链栈中的数据元素的个数\n2:取出栈顶的数据元素的值\n3:栈顶数据元素的插入\n4:栈顶数据元素的删除\n5:清空链栈结束程序\n");
scanf("%d", &a);
switch (a)
{
case 1:
{
int b = 0;
b = StackLength(S);
printf("链栈的数据元素个数为%d\n", b);
break;
}
case 2:
{
int b = 0;
b = GetTop(S, &e);
if (b == 0)
printf("查询栈顶数据元素的值失败\n");
else
printf("栈顶数据元素的值为%d\n", e);
break;
}
case 3:
{
int b = 0;
printf("请输入将要插入的值:");
scanf("%d", &e);
b = Push(&S, e);
if (b == 0)
printf("链栈插入失败\n");
else
printf("链栈插入成功\n");
break;
}
case 4:
{
int b = 0;
b = Pop(&S, &e);
if (b == 0)
printf("链栈删除失败\n");
else
printf("链栈删除成功,删除的栈顶数据元素的值为%d\n", e);
break;
}
case 5:
{
int b = 0;
b = ClearStack(&S);
if (b == 0)
printf("链栈清空失败\n");
else
printf("链栈清空成功\n");
exit(0);
}
default:
break;
}
}
return 0;
}