数据结构之栈篇一,单一数据类型实现。
栈篇C++简单实现,有时间再来补充完整
1、MyStack.h
#ifndef MYSTACK_H
#define MYSTACK_H
class MyStack
{
public:
MyStack(int size); //初始化栈空间
~MyStack(); //回收栈空间
bool stackEmpty(); //判空
bool stackFull(); //判满
void clearStack(); //清空栈
int stackLength(); //已有元素
bool push(char elem); //入栈
bool pop(char &elem); //出栈
char pop();
void stackTraverse(bool isFromButtom); //遍历
private:
char *m_pBuffer; //栈空间指针
int m_iSize; //栈容量
int m_iTop; //栈顶,元素个数
};
#endif
2、MyStack.cpp
#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 = NULL;
}
bool MyStack::stackEmpty()
{
if (m_iTop == 0)
return true;
else
return false;
}
bool MyStack::stackFull()
{
if(m_iTop == m_iSize)
return true;
else
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;
}
//bool MyStack::pop(char &elem)
//{
// if(stackEmpty())
// {
// return false;
// }
// m_iTop--;
// elem = m_pBuffer[m_iTop];
// return true;
//}
char MyStack::pop()
{
if(stackEmpty())
{
throw 1;
}
m_iTop--;
return m_pBuffer[m_iTop];
}
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;
}
}
}
3、测试代码
#include <iostream>
#include <stdlib.h>
#include "MyStack.h"
using namespace std;
int main(int argc, char** argv) {
MyStack *pStack = new MyStack(5);
if(pStack->stackEmpty())
{
cout << "栈空" << endl;
}
pStack->push('h');
pStack->push('e');
pStack->push('r');
pStack->stackTraverse(1);
cout << pStack->pop() << endl;
delete pStack;
pStack = NULL;
return 0;
}