Sequence_Stack（顺序栈的实现）

#include<stdio.h>
#define MAXSIZE 100
typedef int Datatype;
typedef struct {//对栈的定义
Datatype a[MAXSIZE];
int top;
}sequence_stack;


void init(sequence_stack *st)//栈的初始化
{
st->top = 0;
}


int empty(sequence_stack st)//判断栈是否为空
{
return (st.top ? 0 : 1);
}


Datatype read(sequence_stack st)//读取栈顶元素
{
if (empty(st) == 1)
{
printf("栈为空\n");
exit(1);
}
printf("栈顶元素为%d\n", st.a[st.top - 1]);
}


void push(sequence_stack *st, Datatype x)//插入元素
{
if (st->top == MAXSIZE)
{
printf("栈已满，无法进行插入操作！\n");
exit(1);
}
st->a[st->top] = x;
st->top += 1;
}


void dele(sequence_stack *st)//删除栈顶元素
{
if (empty(*st) == 1)
{
printf("栈为空，无法进行删除操作！\n");
exit(1);
}
st->top -= 1;
}


void main()
{
sequence_stack S;
int i = 0;
init(&S);
printf("栈空为1，非空为0：%d\n", empty(S));
for (; i < 7; i++)
push(&S, i * 2);
printf("栈空为1，非空为0：%d\n", empty(S));
read(S);
dele(&S);
read(S);
}