顺序栈

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

#define false 0
#define true 1

typedef int ElementType;
typedef int bool;
typedef int Position;
typedef struct SNode *PtrToSNode;
struct SNode
{
    ElementType *Data;
    Position Top;
    int MaxSize;
};
typedef PtrToSNode Stack;


Stack CreateStack(int MaxSize);       //顺序栈的构建
bool IsEmpty(Stack S);    //判断栈是否为空
bool IsFull(Stack S);     //判断栈是否已满 
bool Push(Stack S, ElementType X);    //入栈
ElementType Pop(Stack S);     //出栈



Stack CreateStack(int MaxSize)       //顺序栈的构建
{
    Stack S = (Stack)malloc(sizeof(struct SNode));
    S->Data = (ElementType *)malloc(MaxSize * sizeof(ElementType));
    S->Top = -1;
    S->MaxSize = MaxSize;
    return S;
}

bool IsEmpty(Stack S)    //判断栈是否为空
{
    return (S->Top == -1);
}

bool IsFull(Stack S)     //判断栈是否已满    
{
    return (S->Top == S->MaxSize-1);
}

bool Push(Stack S, ElementType X)    //入栈
{
    if(IsFull(S))
    {
        printf("栈已经满了,入栈失败！
");
        return false;
    }
    else
    {
        ++S->Top;
        S->Data[S->Top] = X;
        return true;
    }
}

ElementType Pop(Stack S)     //出栈
{
    if(IsEmpty(S))
    {
        printf("栈为空,出栈失败！
");
        return false;
    }
    else
        return (S->Data[(S->top)--]);
}