关于顺序栈的基本操作（c++）

 写作不易，如可请点赞

使用结构体没有使用模板类，理解较为简单。

#include<iostream>
using namespace std;
typedef struct zai{
	int *data;
	int top;
	int maxSize;
}zai,*Zai;

void chu(Zai &z);//初始化 
void panduan(Zai &z);//判空
void qkong(Zai &z);//空顺序栈
void ruzai(Zai &z,int a);// 入栈
int chuzai(Zai &z);//退栈
int quzai(Zai &z);//取栈顶数

int main(){
	Zai z;
	int a,b;
	for(int i=0;i<100;){
		cout<<"1,初始化顺序栈  2,判空"<<"\n"; 
		cout<<"3,清空顺序栈    4,入栈"<<"\n"; 
		cout<<"5,退栈          6,取栈顶数"<<"\n"; 
		cin>>a;
		if(a==1)chu(z);
		if(a==2)panduan(z);
		if(a==3)qkong(z);
		if(a==4){
			cout<<"请输入要入栈的数"<<"\n";
			cin>>b;
			ruzai(z,b);
		}
		if(a==5)cout<<"退栈成功，栈顶为"<<chuzai(z)<<"\n";
		if(a==6)cout<<"栈顶为"<<quzai(z)<<"\n";
	}
	return 0;
}

void chu(Zai &z){
	z->maxSize=100;
	z->data=new int[z->maxSize];
	z->top=-1;
	cout<<"初始化成功"<<"\n";
}

void panduan(Zai &z){
	if(z->top==-1){
		cout<<"顺序栈为空"<<"\n";
	}else{
		cout<<"顺序栈不为空"<<"\n";
	}
}

void qkong(Zai &z){
	z->top=-1;
	if(z->top==-1)cout<<"清空完成"<<"\n";
	else cout<<"清空失败"<<"\n";
}

void ruzai(Zai &z,int a){
	z->top++;
	z->data[z->top]=a;
	if(z->data[z->top]==a)cout<<"添加成功"<<"\n";
	else cout<<"添加失败"<<"\n";
}

int chuzai(Zai &z){
	if(z->top==-1){
		cout<<"栈空无法操作"<<"\n";
	}else{
		return z->data[z->top--];
	}
}

int quzai(Zai &z){
	return z->data[z->top];
}