初学编程C++之栈

代码示例：

#ifndef MYSTACK_H
#define MYSTACK_H
class MyStack
{
public:
	MyStack(int size);//分配内存初始化空间，设定栈容量，栈顶
	~MyStack();//回收栈空间内存
	bool stackEmpty();//判断栈是否为空，为空返回true，非空返回false
	bool stackFull();//判断栈是否为满，为满返回true,非满返回false
	void clearStack();//清空栈
	int stackLength();//已有元素个数
	bool push(char elem);//元素入栈，栈顶上升
	bool pop(char &elem);//元素出栈，栈顶下降
	void stackTraverse(bool isFromButtom);//遍历栈中的元素
private:
	int m_iSize;//栈容量
	char*m_pBuffer;//栈空间指针
	int m_iTop;//栈顶，栈中元素个数
};
#endif

#include"MyStack.h"
#include<iostream>
using namespace std;
MyStack::MyStack(int size)
{
	m_iSize=size;
	m_pBuffer=new char[size];
	m_iTop=0;
}
MyStack::~MyStack()
{
	delete[]m_pBuffer;
	m_pBuffer=0;
}
bool MyStack::stackEmpty()
{
	if(0==m_iTop)
	{
		return true;
	}
	return false;
}
bool MyStack::stackFull()
{
	if(m_iTop==m_iSize)//(m_iTop>=m_iSize)
	{
		return true;
	}
	return false;
}
void MyStack::clearStack()
{
	m_iTop=0;
}
int MyStack::stackLength()
{
	return m_iTop;
}
bool MyStack::push(char elem)
{
	if(stackFull())
	{
		return false;
	}
	m_pBuffer[m_iTop]=elem;
	m_iTop++;
	return true;
}
//char MyStack::pop ()
//{
//	if(stackEmpty())
//	{
//		throw 1;
//	}
//	else
//	{
//		m_iTop--;
//		return m_pBuffer[m_iTop];
//	}
//}
bool MyStack::pop(char &elem)
{
	if(stackEmpty())
	{
		return false;
	}
	m_iTop--;
	elem=m_pBuffer[m_iTop];
	return true;
}
void MyStack:: stackTraverse(bool isFromButtom)
{
	if(isFromButtom)
	{
		  for(int i=0;i<m_iTop;i++)//栈底到栈顶遍历
	  {
		cout<<m_pBuffer[i]<<","<<endl;
	  }
	}
	else
	{
		for(int i=m_iTop-1;i>=0;i--)//栈顶到栈底遍历
	  {
		cout<<m_pBuffer[i]<<","<<endl;
	  }
	}
}

//栈机制，栈底和栈顶为栈要素，后进先出
#include<iostream>
#include"stdlib.h"
#include"MyStack.h"
using namespace std;
/*
  栈类：
    要求：
	  MyStack(int size);//分配内存初始化空间，设定栈容量，栈顶
	  ~MyStack();//回收栈空间内存
	  bool stackEmpty();//判断栈是否为空，为空返回true，非空返回false
	  bool stackFull();//判断栈是否为满，为满返回true,非满返回false
	  void clearStack();//清空栈
	  int stackLength();//已有元素个数
	  void push(char elem);//元素入栈，栈顶上升
	  void pop(char &elem);//元素出栈，栈顶下降
	  void stackTraverse();//遍历栈中的元素

	  目的：掌握栈的实现原理和运行机制
	  */
int main()
{
	MyStack*pStack=new MyStack(5);
	pStack->push ('c');//底
	pStack->push ('h');
	pStack->push ('a');
	pStack->push ('r');
	pStack->push ('!');//顶
	pStack->stackTraverse(true);
	cout<<endl;

	char elem=0;
	pStack->pop(elem);
	cout<<elem<<endl;
	cout<<pStack->stackLength()<<endl;
	pStack->stackTraverse(true);
	cout<<endl;
	cout<<endl;

	pStack->stackTraverse(false);
	char ele =0;
	pStack->pop(ele );
	cout<<ele <<endl;
	cout<<pStack->stackLength()<<endl;
	pStack->stackTraverse(true);
	cout<<endl;
	cout<<endl;

	pStack->clearStack();
	cout<<pStack->stackLength()<<endl;
	if(pStack->stackEmpty())
	{
		cout<<"empty"<<endl;
	}
	if(pStack->stackFull())
	{
		cout<<"full"<<endl;
	}
	delete pStack;
	pStack=NULL;
	system("pause");
	return 0;
}

打印结果：