顺序栈的基本操作

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

#define OK 1
#define ERROR 0
#define OVERFLOW -2
#define MAXSIZE 100

typedef int Status;

//定义结构体
typedef struct
{
    int *base;
    int *top;
    int stacksize;
}SqStack;

//栈的创建
Status InitStack(SqStack *S)
{
    S->base=(int *)malloc(sizeof(int));
    if(!S->base)
        return ERROR;
    S->top=S->base;
    S->stacksize=MAXSIZE;
    return OK;
}

//入栈
Status Push(SqStack *S,int e)
{
    if(S->top-S->base==MAXSIZE)
        return ERROR;//栈满
    *(S->top)++=e;
    return OK;
}

//取栈顶元素
Status GetTop(SqStack *S,int *e)
{
    if(S->base==S->top)
        return ERROR;
    *e=*(S->top-1);//重点理解--S->top和S->top-1的区别
    return OK;
}

//出栈
Status Pop(SqStack *S,int *e)
{
    if(S->top==S->base)
        return ERROR;//栈空
    *e=*(--S->top);
    return OK;
}

//清空栈
Status ClearStack(SqStack *s)
{
    s->top=s->base;
    return OK;
}

//销毁栈
Status DestroyStack(SqStack *S)
{
    if(S->base)
    {
        free(S->base);
        S->stacksize=0;
        S->base=S->top=NULL;
    }
    return OK;
}

void main()
{
    SqStack s;
    int a,i,b,c,d;

    //栈的创建
    if(!InitStack(&s))
    {
        printf("创建栈失败\n\n");
        exit(OVERFLOW);
    }

    //入栈
    printf("输入元素的个数:");
    scanf("%d",&a);
    printf("输入元素：\n");
    for(i=0;i<a;i++)
    {
        scanf("%d",&b);
        if(!Push(&s,b))
            printf("栈满\n\n");
    }
    printf("\n");

    //取栈顶元素
    printf("取栈顶元素：");
    if(!GetTop(&s,&d))
        printf("栈空");
    else printf("%d",d);
    printf("\n\n");

    //出栈
    printf("顺序出栈:\n");
    for(i=0;i<a;i++)
    {
        if(!Pop(&s,&c))
            printf("栈空\n");
        else
            printf("%d ",c);
    }
    printf("\n\n");

    //栈的元素个数
    printf("栈的长度为：%d\n\n",a);

    //清空顺序栈
    if(ClearStack(&s))
        printf("已清除顺序栈\n\n");

    //销毁顺序栈
    if(DestroyStack(&s))
        printf("已销毁栈\n\n");
}