栈的数组实现

/*
  栈的数组实现
*/

/*接口头文件*/

typedef int ElementType;
#ifndef _STACK_H
#define _STACK_H
#include <stdbool.h>
struct StackRecord;
typedef struct StackRecord * Stack;

/*操作集*/
bool IsEmpty( Stack S );
bool IsFull( Stack S );
Stack CreateStack( int MaxElements );
void MakeEmpty( Stack S );
void Push( ElementType X, Stack S );
void Pop( Stack S );
ElementType Top( Stack S );
void DisposeStack( Stack S );
void PrintfStack( Stack S );

#endif


/*接口实现*/
#include <stdio.h>
#include <stdlib.h>
#include "stack.h"

#define EMPTYTOS ( -1 )        //空栈标志 
#define MinStackSize ( 5 )     //指定栈的最小空间

/*特定结构体定义*/
struct StackRecord
{
    int Capacity;   //栈空间大小
    int TopOfStack; //栈顶。当其值为0，则栈为空
    ElementType * Array; //存储数据 
};

/*由MaxElements指定栈的大小*/ 
Stack CreateStack( int MaxElements )
{
    Stack S;
    
    if ( MaxElements < MinStackSize )
    {
       printf( "Stack is smallr\n" );
       exit( 1 );
    }
    S = ( Stack )malloc( sizeof( struct StackRecord ) );
    if ( S == NULL )
    {
       printf( "No Space!!!\n" );
       exit( 1 );
    }
    S->Array = ( ElementType )malloc( sizeof( ElementType ) * MaxElements );
    if ( S->Array == NULL )
    {
       printf( "No Space!!!\n" );
       exit( 1 );
    }
    S->Capacity = MaxElements;
    MakeEmpty( S );
    
    return S;
}

void MakeEmpty( Stack S )
{
    S->TopOfStack = EMPTYTOS;
}

bool IsEmpty( Stack S )
{
    return S->TopOfStack == EMPTYTOS;
}

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

void Push( ElementType X, Stack S )
{
    if ( IsFull( S ) )
    {
       printf( "Stack is full\n" );
       exit( 1 );
    }
    else
        S->Array[ ++S->TopOfStack ] = X;
}

void Pop( Stack S )
{
    if ( IsEmpty( S ) )
    {
       printf( "Stack is empty\n" );
       exit( 1 );
    }
    else
        S->TopOfStack--;
}

ElementType Top( Stack S )
{
    if ( IsEmpty( S ) )
    {
       printf( "Stack is empty\n" );
       exit( 1 );
    }
    else
        return S->Array[ S->TopOfStack ];
}

void DisposeStack( Stack S )
{
    free( S->Array );
    free( S );
}

void PrintfStack( Stack S )
{
    if ( IsEmpty( S ) )
       printf( "No Data\n" );
    else
        for ( int i = S->TopOfStack; i >=0; i-- )
            printf( "%3d", S->Array[ i ] );
            
    printf( "\n" );
}