顺序栈---算法

#include <stdio.h>
#include <stdlib.h>

#define stackintitsize 100
#define stackincrenment 10

typedef struct {
    int a;
}SElemType;

typedef struct {
    SElemType *base;
    SElemType *top;
    int stacksize;
}Sqstack;

Sqstack* InitStack(void); //顺序栈的初始化
int JudegeStackEmpty(Sqstack *S); //判断顺序栈是否为空
int LenStack (Sqstack *S); //计算顺序栈长度
void ClearStack (Sqstack *s); //清空顺序栈
void DestroyStack (Sqstack *S); //销毁顺序栈
void Push(Sqstack *S, SElemType e); //入栈操作
SElemType POP(Sqstack *S); //出栈操作

int main () {
    Sqstack *S;
    S = InitStack();
    DestroyStack(S);
}

//顺序栈的初始化
Sqstack* InitStack(void) {
    Sqstack *S;
    S = (Sqstack*)malloc(sizeof(Sqstack));
    S->base = (SElemType*)malloc(stackintitsize*sizeof(SElemType));
    if (!S->base) {
        exit(0);
    }
    S->top = S->base;
    S->stacksize = stackintitsize;
    return S;
}

//判断顺序栈是否为空
int JudegeStackEmpty(Sqstack *S) {
    int ret = 0;
    if (S->base == S->top) {
        ret = 1;
    }
    return ret;
}

//计算顺序栈长度
int LenStack (Sqstack *S) {
    return S->top-S->base;
}

//清空顺序栈
void ClearStack (Sqstack *s) {
    if (s->base) {
        s->top = s->base;
    }
}

//销毁顺序栈
void DestroyStack (Sqstack *S) {
    if (S->base) {
        free(S->base);
        S->stacksize = 0;
        S->top = S->base = NULL;
        free(S);
        S = NULL;
    }
}

//入栈操作
void Push(Sqstack *S, SElemType e) {
    if (S->top-S->base >= S->stacksize) {
        S->base = (SElemType *)realloc (S->base, (S->stacksize+stackincrenment)*sizeof (SElemType));
        if (!S->base) {
            exit(0);
        }
        S->top = S->base+S->stacksize;
        S->stacksize += stackincrenment;
    }
    *S->top++=e;
}

//出栈操作
SElemType POP(Sqstack *S) {
    SElemType e;
    if (S->top == S->base) {
        exit(0);
    }
    S->top--;
    e=*S->top;
}