C/C++语言实现数据结构系列（三）——顺序表实现栈

#include<stdio.h>

#define MAXSIZE 8
#define ERROR 0
#define Status int
#define SUCCESS 1 

//栈结构体表示
typedef struct stack{
	int data[MAXSIZE];
	int top;
}*Stack;

//初始化栈
void initStack(Stack &stack){
	stack->top = -1;
}

//判断是否为空
Status isEmpty(Stack stack){
	if(stack->top == -1){
		return 1;
	}else{
		return 0;
	}
}
//判断栈是否已满
Status isFull(Stack stack){
	if(stack->top == MAXSIZE - 1){
		return 1;
	}else{
		return 0;
	}
}
//入栈
Status add(Stack &stack,int data){
	if(isFull(stack)){
		return ERROR;
	}
	stack->top++;
	stack->data[stack->top] = data;
	return SUCCESS;
}
//出栈
Status get(Stack stack,int &data){
	if(isEmpty(stack)){
		data = -1;
		return ERROR;
	}
	data = stack->data[stack->top];
	stack->top--;
	return SUCCESS;
}

int main(){
	Stack stacks = new stack;
	initStack(stacks);
	add(stacks,1);
	add(stacks,2);
	add(stacks,3);
	int data;
	get(stacks,data);
	printf("%d\n",data);
	get(stacks,data);
	printf("%d\n",data);
	get(stacks,data);
	printf("%d\n",data);
	get(stacks,data);
	printf("%d\n",data);
}