栈-顺序存储

#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 20
typedef int dataType ;
typedef struct {
dataType data[MAXSIZE];
int top;
}SeqStack;


SeqStack *InitSeqStack(); //初始化栈
void CreateSeqStack(); //创建栈
int EmptySeqStack(); //判空栈
int PushSeqStack(); //入栈
int PopSeqStack(); //出栈
dataType TopSeqStack(); //取栈顶元素
void Print(); //输出栈内元素


void main () {
SeqStack *s;
int n;
s = InitSeqStack();
// printf("%d\n",EmptySeqStack(s));
CreateSeqStack(s);
Print(s);
PopSeqStack(s, &n);
Print(s);
PushSeqStack(s, 111);
Print(s);
}


SeqStack *InitSeqStack () {
SeqStack *s;
printf("\n***********初始化栈***********\n");
s = malloc(sizeof(SeqStack));
s->top = -1;
return s;
}


void CreateSeqStack (SeqStack *s) {
int i, n;
printf("\n***********创建栈***********\n");
printf("设置栈内元素个数 : ");
scanf("%d",&n);
for (i = 0; i < n; i++) {
printf("第%d位元素 : ",i+1);
scanf("%d",&s->data[i]);
s->top++;
}
}


int EmptySeqStack (SeqStack *s) {
printf("\n***********判空栈***********\n");
if (s->top == -1) 
return -1;
else 
return 0;
}


int PushSeqStack (SeqStack *s, dataType x) {
printf("\n***********入栈***********\n");
if (s->top == MAXSIZE-1)
return 0;
else {
s->top++;
s->data[s->top] = x;
return 1;
}
}


int PopSeqStack (SeqStack *s, dataType *x) {
printf("\n***********出栈***********\n");
if (EmptySeqStack(s))
return 0;
else {
*x = s->data[s->top];
s->top--;
printf("%d\n",*x); //查看出栈元素
return 1;
}
}


dataType TopSeqStack (SeqStack *s) {
printf("\n***********取栈顶元素***********\n");
if (EmptySeqStack(s))
return 0;
else 
return s->data[s->top];
}


void Print (SeqStack *s) {
int i;
printf("\n***********输出栈***********\n");
for (i = 0; i <= s->top; i++) 
printf("第%d位元素 : %d\n",i+1, s->data[i]);
}