顺序栈的C语言实现

#include <stdbool.h>
#include "stdio.h"
#define MAXSIZE 20
#define OK 1
#define ERROR 0

struct sqStack{
    int data[MAXSIZE];
    int top;
};

/*初始化操作，建立一个空栈*/
int initStack(struct sqStack *s){
    s->top=-1;
    return OK;
}

/*若栈存在，则销毁*/
int destoryStack(struct sqStack *s){
    if(s->top==-1){
        printf("该栈不存在\n");
        return ERROR;
    }
    s->top=-1;
    return OK;
}

/*清空栈*/
int clearStack(struct sqStack *s){
    if(s->top==-1){
        printf("该栈不存在\n");
        return ERROR;
    }
    s->top=-1;
    return OK;
}

/*判断栈是否为空*/
 bool isEmpty(struct sqStack *s){
     if(s->top==-1){
         return true;
     }
     return false;
 }

 /*获取栈顶元素*/
int getTop(struct sqStack *s ,int *e){
    if(isEmpty(s)){
        return ERROR;
    }
    *e=s->data[s->top];
     return OK;
}

/*压栈*/
int push(struct sqStack *s,int e){
    if(s->top==MAXSIZE-1){
        printf("该栈已满!");
        return ERROR;
    }
    s->top++;
    s->data[s->top]=e;

    return OK;
}

/*pop*/
int pop(struct sqStack *s ,int *e){
    if(isEmpty(s)){
        return ERROR;
    }
    *e=s->data[s->top];
    s->top--;
    return OK;
}

/*获取长度*/
int getLength(struct sqStack *s){
    if(isEmpty(s)){
        return -1;
    }
    return s->top+1;
}

int display(struct sqStack *s){
    int length=0;
    length=getLength(s);
    if(length>=0){
        printf("the length is %d\n",length);
    }

    if(isEmpty(s)){
        return ERROR;
    }
    while(s->top>=0){
        printf("%d\n",s->data[s->top]);
        s->top--;
    }
    //注意显示结束之后需要将top移动栈顶
    s->top=length-1;
    return OK;
}

int main(){
    struct sqStack *myStack;
    int data;
    initStack(myStack);
    //isEmpty(myStack);
    push(myStack,1);
    push(myStack,2);
    push(myStack,3);
    printf("myStack has %d eles\n",getLength(myStack));
    display(myStack);

    pop(myStack,&data);
    printf("the pop ele is %d\n",data);
    printf("myStack has %d eles\n",getLength(myStack));
    display(myStack);
    destoryStack(myStack);
    display(myStack);


}