C语言顺序栈

栈为只能在一端修改数据的数据结构，顺序栈结构为一个数组和一个指向尾部的top变量,当进栈时把元素放入下标为top的数组元素中去，top+1。出栈的话就是top-1

#include<stdio.h>
#define MAXSIZE 1024

typedef int elemtype;

typedef struct sequenStack{
    elemtype date[MAXSIZE];
    int top;
}SequenStack;

int Pop_SequenStack(SequenStack *p,elemtype *e){//出栈
    
    if(p->top<0)
        return 0;
    
    *e = p->date[p->top];
    p->top--;
    return 1;
    
}

int Push_SequenStack(SequenStack *p,elemtype e){//入栈
    
    if(p->top>=MAXSIZE-1)
        return 0;
    
    p->top++;
    p->date[p->top] = e;
    return 1;
    
}

SequenStack *init_SequenStack(){//初始化
    
    SequenStack *p = (SequenStack *)malloc(sizeof(SequenStack));
    if(p==NULL)
        return NULL;
    
    p->top = -1;
    return p;
    
}

void main(){
    
    SequenStack *top = init_SequenStack();
    
}