C++基础之栈篇

MyStack.h文件

#ifndef MYSTACK_H
#define MSYTACK_H
class MyStack
{
public:
MyStack(int size);
~MyStack();
bool stackEmpty();
bool stackFull();
void clearStack();
int stackLength();
bool push(char elem);
bool pop(char &elem);
void stackTraverse(bool isFromButtom);


private:
char *m_pBuffer;
int m_iSize;
int m_iTop;
};
#endif

MyStack.cpp文件

#include<iostream>
#include "MyStack.h"
using namespace std;


MyStack::MyStack(int size)
{
m_iSize = size;
m_pBuffer = new char[size];
m_iTop = 0;
}
MyStack::~MyStack()
{
delete[]m_pBuffer;
}
bool MyStack::stackEmpty()
{
if (0 == m_iTop)
{
return true;
}
return false;
}
bool MyStack::stackFull()
{
if (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;
}
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];
}
}
else
{
for (int i = m_iTop - 1; i >= 0; i--)
{
cout << m_pBuffer[i];
}
}


}

demo.cpp文件

#include<iostream>
#include"stdlib.h"
#include"MyStack.h"
using namespace std;


int main(void)
{
MyStack *pStack = new MyStack(5);


cout << pStack->stackLength() << endl;


if (pStack->stackEmpty())
{
cout << "栈为空" << endl;
}
if (pStack->stackFull())
{
cout << "栈为满" << endl;
}


delete pStack;
pStack = NULL;
system("pause");
return 0;
}