栈的顺序存储结构以及实现

#include "stdafx.h"
#include <iostream>
#include <exception>
using namespace std;

//栈的顺序存储结构及实现
//栈的结构定义
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define MAXSIZE 5
typedef int sElemType;
typedef int Status;
typedef struct
{
    sElemType data[MAXSIZE];
    int top;
}SqStack;
Status Init(SqStack *S)
{

    for(int i = 0;i!=MAXSIZE;++i)
    {
        S->data[i]=0;
    }
    S->top = -1;
    return OK;
}
//压栈操作
Status Push(SqStack *S,sElemType e)
{
    if(S->top == MAXSIZE - 1)
    {
        cout<<"栈满"<<endl;
        return ERROR;
    }
    S->top++;
    S->data[S->top]=e;
    return OK;
}
//出栈操作
Status Pop(SqStack *S,sElemType *e)
{
    if(S->top == -1)
    {
        cout<<"栈空"<<endl;
        return ERROR;
    }
    *e = S->data[S->top];
    (S->top)--;
    return OK;
}
//输出栈内元素
Status ReadStack(const SqStack *S)
{
    cout<<"栈内元素:";
    for(int i = 0;i<=S->top;++i)
    {
        cout<<S->data[i]<<" ";
    }
    cout<<endl;
    return OK;
}

int _tmain(int argc, _TCHAR* argv[])
{
    SqStack *stack = (SqStack*)malloc(sizeof(SqStack));
    Init(stack);//初始化栈
    Push(stack,1);//将1入栈
    Push(stack,2);//将2入栈
    Push(stack,3);//将3入栈
    Push(stack,4);//将4入栈
    ReadStack(stack);//输出栈内元素
    int popElem = 0;
    Pop(stack,&popElem);//出栈栈顶值赋予popElem
    cout<<"出栈:"<<popElem<<endl;
    Pop(stack,&popElem);//出栈栈顶值赋予popElem
    cout<<"出栈:"<<popElem<<endl;
    Pop(stack,&popElem);//出栈栈顶值赋予popElem
    cout<<"出栈:"<<popElem<<endl;
    ReadStack(stack);//输出栈内元素
    Pop(stack,&popElem);//出栈栈顶值赋予popElem
    cout<<"出栈:"<<popElem<<endl;
    return 0 ;
}