[数据结构与算法] : 栈的数组实现

头文件

typedef int ElementType;

#ifndef _STACK_AR_
#define _STACK_AR_

struct StackRecord;
typedef struct StackRecord *Stack;

int IsEmpty(Stack S);
int IsFull(Stack S);
Stack CreateStack(int MaxElements);
void DisposeStack(Stack S);
void MakeEmpty(Stack S);
void Push(ElementType X, Stack S);
ElementType Top(Stack S);
void Pop(Stack S);
ElementType TopAndPop(Stack S);

#endif

源文件

#include "stackar.h"
#include <malloc.h>
#include "fatal.h"
#include <stdlib.h>

#define EmptyTOS (-1)
#define MinStackSize (5)

struct StackRecord
{
    int Capacity;
    int TopOfStack;
    ElementType *Array;
};

int IsEmpty(Stack S)
{
    return S->TopOfStack == EmptyTOS;
}

int IsFull(Stack S)
{
    return S->TopOfStack == S->Capacity - 1;
}

Stack CreateStack(int MaxElements)
{
    Stack S;

    if(MaxElements < MinStackSize)
        Error("Stack size is to small!");

    S = (Stack)malloc( sizeof(struct StackRecord) );
    if( S == NULL )
        FatalError("Out of Space!");

    S->Array = (ElementType*)malloc( sizeof(ElementType) * MaxElements );
    if(S->Array == NULL)
        FatalError("Out of Space!");
    S->Capacity = MaxElements;
    MakeEmpty(S);

    return S;
}

void DisposeStack(Stack S)
{
    if(S != NULL)
    {
        free(S->Array);
        free(S);
    }
}

void MakeEmpty(Stack S)
{
    if(S == NULL)
        Error("Create stack first!");
    else
        S->TopOfStack = EmptyTOS;
}

void Push(ElementType X, Stack S)
{
    if( IsFull(S) )
        Error("Full Srack!");
    else
        S->Array[++S->TopOfStack] = X;
}

ElementType Top(Stack S)
{
    if( IsEmpty(S) )
    {
        Error("Empty Srack!");
        return 0; /* return value used to avoid warning */
    }
    else
        return S->Array[S->TopOfStack];
}

void Pop(Stack S)
{
    if( IsEmpty(S) )
        Error("Empty Srack!");
    else
        --S->TopOfStack;
}

ElementType TopAndPop(Stack S)
{
    if( IsEmpty(S) )
    {
        Error("Empty Srack!");
        return 0; /* return value used to avoid warning */
    }
    else
        return S->Array[S->TopOfStack--];
}

测试文件

#include <stdio.h>
#include "stackar.h"

main( )
{
    Stack S;
    int i;

    S = CreateStack( 12 );
    for( i = 0; i < 10; i++ )
        Push( i, S );

    while( !IsEmpty( S ) )
    {
        printf( "%d
", Top( S ) );
        Pop( S );
    }

    DisposeStack( S );
    return 0;
}