栈的代码

#include <iostream>
using namespace std;
class zhan
{
public:
	zhan(int rongliang);
	~zhan();
	bool zhanempty();
	bool zhanfull();
	int zhanlen();
	void clearzhan();
	bool jinzhan(char nso);
	bool chuzhan(char &nso);
	void print(bool panduan);
private:
	char *shuju;//数组存放值 
	int len;//栈存放的值的数量 
	int liang;//栈的容量 
};
zhan::zhan(int rongliang)//初始化 
{
	liang = rongliang;
	len = 0;
	shuju= new char[rongliang];
}
zhan::~zhan()//销毁 
{
	delete []shuju;
	shuju=NULL;
}
bool zhan::zhanempty()//判断栈是否为空 
{
	if(0==len)
	{
		return true;
	}
	return false;
}
bool zhan::zhanfull()//判断栈是否已满 
{
	if(len==liang)
	{
		return true;
	}
	return false;
}
int zhan::zhanlen()//栈存放的值的数量 
{
	return len;
}
void zhan::clearzhan()//清空栈 
{
	len=0;
}
bool zhan::jinzhan(char nso)//进栈 
{
	if(zhanfull())
	{
		return false;
	}
	else
	{
		shuju[len]=nso;
		len++;
		return true;
	}
}
bool zhan::chuzhan(char &nso)//出栈 
{
	if(zhanempty())
	{
		return false;
	}
	else
	{
		len--;
		nso=shuju[len];
		return true;
	}
}
void zhan::print(bool panduan)//打印 
{
	if(panduan)
	{
		for(int i=0;i<len;i++)
	{
		cout<<shuju[i];
	}
	}
	else
	{
		for(int i=len-1;i>=0;i--)
		{
			cout<<shuju[i]<<",";
		}
	}	
}
int main()
{
	zhan *p=new zhan(3);
	p->jinzhan('h');
	p->jinzhan('e');
	p->jinzhan('l');
	char a;
	p->chuzhan(a);
	//p->clearzhan();
	cout<<p->zhanlen()<<endl;
	p->print(false);
	if(p->zhanempty())
	{
		cout<<"栈为空"<<endl;
	}
	if(p->zhanfull())
	{
		cout<<"栈为满"<<endl;
	}
	return 0;
}