顺序栈

/*
顺序栈
LJK 2018-07-03
*/

#include<stdio.h>

#define MAXSIZE 15
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0

typedef int SElemType; 
typedef int Status;

typedef struct sqStack
{
    SElemType data[MAXSIZE];    // 数组，存放数据元素
    int top;                    // 用于栈顶指针
}SqStack;

// 构造一个空栈
Status InitStack(SqStack *S)
{
    S->top = -1;
    return OK;
}

// 压栈操作
Status Push(SqStack *S, SElemType e)
{
    if (S->top == MAXSIZE - 1) return ERROR;  // 栈满
    S->data[++S->top] = e;
    return OK;
}

// 出栈操作
Status Pop(SqStack *S, SElemType *e)
{
    if (S->top == -1) return ERROR; // 空栈
    *e = S->data[S->top--];
    return OK;
}

// 遍历元素
Status StackTraverse(SqStack S)
{
    int i = 0;
    while (i<=S.top)
    {
        printf("%d ", S.data[i++]);
    }
    printf("
");
    return OK;
}

Status StackEmpty(SqStack S)
{
    if (S.top == -1) return TRUE;
    else  return    ERROR;
}

Status GetTop(SqStack S, SElemType *e)
{
    if (S.top == -1)return ERROR;
    else *e = S.data[S.top];
    return OK;
}

Status ClearStack(SqStack *S)
{
    S->top = -1;
    return OK;
}

int StackLength(SqStack S)
{
    return S.top + 1;
}

int main()
{
    SqStack s;
    int j;
    SElemType e;

    if (InitStack(&s) == OK)
    {
        for (j = 1; j <= 10; j++)
            Push(&s, j);
    }
    printf("栈中元素依次为：");
    StackTraverse(s);
    printf("
");

    Pop(&s, &e);
    printf("弹出栈顶元素：%d", e);
    printf("栈中元素依次为：");
    StackTraverse(s);
    printf("
");

    printf("栈是否空:%d   (1:空 0:否)
", StackEmpty(s));
    printf("
");

    GetTop(s, &e);
    printf("栈顶元素e = %d，栈的长度为：%d
", e, StackLength(s));
    printf("
");

    ClearStack(&s);

    printf("清空栈后，栈是否为空：%d   (1:空 0:否)", StackEmpty(s));
    printf("
");

    getchar();
    return 0;
}