数据结构 顺序栈的基本操作

#include <stdio.h>


#define MAXSIZE  1000
#define OK       1
#define ERROR    0

typedef int SElemType;

typedef struct
{
	SElemType data[MAXSIZE];
	int top;
}SqStack;

int InitSqStack(SqStack &S)
{
	S.top = 0;
	return OK;
}

int Push(SqStack &S, SElemType e)
{
	if (S.top == MAXSIZE-1)
	{
		return ERROR;
	}
	S.top++;
	S.data[S.top] = e;
	return OK;
}

int Pop(SqStack &S, SElemType &e)
{
	if (S.top == 0)
	{
		return ERROR;
	}
	e = S.data[S.top];
	S.top--;
	return OK;
}