顺序栈

#include<stdio.h>
#include<malloc.h>
#include<iostream>
//宏定义
#define  TRUE  1
#define  FALSE 0
#define  OK    1
#define  ERROR 0
#define  INFEASIBLE -1
#define  OVERFLOW   -2
#define  STACK_INIT_SIZE  100
#define  STACKINCREMENT    10
using namespace std;
typedef  int  ElemType;
typedef  int    Status;

//栈的顺序结构表示
typedef struct
{
    ElemType *base;
    ElemType  *top;
    int  stacksize;
} SqStack;

//1.构建一个空栈
Status InitStack(SqStack &S)
{
    S.base = (ElemType*)malloc(STACK_INIT_SIZE*sizeof(ElemType));
    if (!S.base)
        exit(OVERFLOW);//存储分配失败
    S.top = S.base;
    S.stacksize = STACK_INIT_SIZE;
    return OK;
}

//2.销毁栈
Status DestroyStack(SqStack &S)
{
    S.top = NULL;
    S.stacksize = 0;
    free(S.base);
    return OK;
}

//3.清空栈
Status ClearStack(SqStack &S)
{
    S.top = S.base;
    return OK;
}

//4.判断栈是否为空
Status StackEmpty(SqStack S)
{
    if (S.top == S.base)
        return ERROR;
    else
        return TRUE;
}

//5.求栈的长度
Status StackLength(SqStack S)
{
    if (S.top == S.base)
        return FALSE;
    else
        return (S.top - S.base);//也可以直接返回S.top - S.base
}

//6.求栈顶元素
Status GetTop(SqStack S, ElemType &e)
{
    if (S.top == S.base)
        return FALSE;
    else
        e = *(S.top - 1);
    return e;
}

//7.栈顶插入元素
Status Push(SqStack &S, ElemType &e)
{
    if (S.top - S.base >= STACK_INIT_SIZE)
    {
        S.base = (ElemType *)realloc(S.base, (S.stacksize + STACKINCREMENT) * sizeof(ElemType));
        if (!S.base)
        {
            return false;
        }
        S.top = S.base + STACK_INIT_SIZE;//栈底地址可能改变，重新定位栈顶元素
        S.stacksize = S.stacksize + STACKINCREMENT;
    }
    *S.top++= e;
    return OK;
}

//8.删除栈顶元素
Status Pop(SqStack &S, ElemType &e)
{
    if (S.top == S.base)
        return ERROR;
    else
    {
        e = *--S.top;
        return e;
    }
}

//9.遍历栈
Status StackTraverse(SqStack S)
{
    if (S.base == NULL)
        return ERROR;
    if (S.top == S.base)
        printf("栈中没有元素\n");
    ElemType *p;
    p = S.top;
    while (p > S.base)
    {
        p--;
        printf("%d ",*p);
    }
    printf("\n\n");
    return OK;
}

//主函数检验九种操作
int main()
{
    SqStack S;

    InitStack(S);
    int i,n,e ;
    printf("输入栈的长度:\n");
    scanf("%d",&n);
    printf("输入栈的元素\n");
    for (i = 1; i <= n; i++)
    {
        ++S.top;
        scanf("%d",S.top-1);
    }


    if (StackEmpty(S) == 1)
        printf("栈非空\n\n");
    else
        printf("栈为空\n\n");


    printf("栈的长度是:%d\n\n",StackLength(S));


    printf("遍历输出栈中的所有元素:\n");
    StackTraverse(S);


    cout<<"栈顶元素是:"<<GetTop(S,e)<<endl;


    printf("请输入要插入的元素的数值:\n");

    cin>>e;
    Push(S,e);
    printf("现在栈中的元素是:\n");
    StackTraverse(S);


    printf("删除栈顶元素:\n");
    cout<<"被删元素是:"<<Pop(S,e)<<endl<<endl;
    printf("现在栈中的元素是:\n");
    StackTraverse(S);

    return 0;
}