利用顺序栈数据结构存储数据,并用简单的交互实现进栈和出栈。
//ADT 栈(Stack) 顺序存储结构 SqStack
#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
{
ElemType data[MAXSIZE];
int top; //用于栈顶指针
} SqStack;
//顺序栈的初始化
Status InitStack(SqStack *S)
{
S->top = -1;
return OK;
}
//判断顺序栈是否初始化成功
Status StackEmpty(SqStack S)
{
if (S.top == -1)
return TRUE;
else
return FALSE;
}
//清空顺序栈
Status ClearStack(SqStack *S)
{
S->top = -1;
return OK;
}
//查询数据元素个数
Status StackLength(SqStack S)
{
return S.top + 1;
}
//顺序栈的取值,只能取出栈顶的数据元素的值
Status GetTop(SqStack S, ElemType *e)
{
if (S.top == -1)
return ERROR;
else
*e = S.data[S.top];
return OK;
}
//顺序栈的插入
Status Push(SqStack *S, ElemType e)
{
if (S->top == MAXSIZE - 1) //判断顺序栈是否栈满
return ERROR;
S->top++;
S->data[S->top] = e;
return OK;
}
//顺序栈的删除
Status Pop(SqStack *S, ElemType *e)
{
if (S->top == -1)
return ERROR;
*e = S->data[S->top];
S->top--;
return OK;
}
//顺序栈的数据输入
Status CreateElem(SqStack *S)
{
printf("请输入一组整型数据:");
while (TRUE)
{
S->top++;
scanf("%d", &S->data[S->top]);
char c = getchar();
if (c == '\n')
break;
}
return OK;
}
//顺序栈主函数
int main()
{
SqStack 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.top + 1);
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;
}