/*
** File name: SeqStack.h
** Author: ZhouFeng
** Date: 2012/03/26
*/
#ifndef SEQ_STACK_H
#define SEQ_STACK_H
#define MAX_SIZE 100
#define ERROR 0
#define SUCCESS 1
#define TRUE 1
#define FALSE 0
typedef int BOOL;
typedef int EleType;
typedef struct SeqStack
{
EleType _seqStack[MAX_SIZE];
int top;
}SeqStack;
void InitSeqStack(SeqStack *S);
BOOL IsStackEmpty(SeqStack *S);
int Push(SeqStack *S, EleType data);
int Pop(SeqStack *S, EleType *data);
int GetTop(SeqStack *S, EleType *data);
#endif
#include
#include "SeqStack.h"
void InitSeqStack(SeqStack *S)
{
if(S == NULL)
{
return;
}
S->top = 0;
}
BOOL IsStackEmpty(SeqStack *S)
{
if(S == NULL)
{
return TRUE;
}
if(S->top > 0)
{
return FALSE;
}
else
{
return TRUE;
}
}
int Push(SeqStack *S, EleType data)
{
if(S == NULL && S->top > MAX_SIZE)
{
return ERROR;
}
S->_seqStack[S->top] = data;
++S->top;
return SUCCESS;
}
int Pop(SeqStack *S, EleType *data)
{
if(S == NULL && S->top <= 0)
{
return ERROR;
}
--S->top;
*data = S->_seqStack[S->top];
return SUCCESS;
}
int GetTop(SeqStack *S, EleType *data)
{
if(S == NULL && S->top <= 0)
{
return ERROR;
}
*data = S->_seqStack[S->top - 1];
return SUCCESS;
}