C++数据结构___栈
栈
数据结构探险—栈篇
C++实现栈记录
MyStack.h
#pragma once
#includeMyStack.cpp
#include"MyStack.h"
//初始化
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)//if(m_iTop == 0)//区别赋值
{
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;
}
//char MyStack::pop()
//{
// if (stackEmpty())
// {
// throw 1;
// }
// else
// {
// 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] << ",";
}
}
else
{
for (int i = m_iTop - 1; i >= 0; i--)
{
cout << m_pBuffer[i] << ",";
}
}
}
demo.cpp
#include改造后
Coordinate.h
#pragma once
#includeCoordinate.cpp
#include"Coordinate.h"
Coordinate::Coordinate(int x = 0, int y = 0)
{
m_iX = x;
m_iY = y;
}
void Coordinate::printCoordinate()
{
cout << "(" << m_iX << "," << m_iY << ")" << endl;
}
MyStack.h修改
public:
bool push(Coordinate elem);//元素入栈，栈顶上升
bool pop(Coordinate& elem);//元素出栈，栈顶下降
private:
Coordinate* m_pBuffer;//占空间指针
MyStack.cpp修改
//初始化
MyStack::MyStack(int size)
{
m_iSize = size;
//m_pBuffer = new char[size];
m_pBuffer = new Coordinate[size];
m_iTop = 0;
}
//元素入栈，栈顶上升
//bool MyStack::push(char elem)
bool MyStack::push(Coordinate elem)
{
if (stackFull())
{
return false;
}
m_pBuffer[m_iTop] = elem;
m_iTop++;
return true;
}
//元素出栈，栈顶下降
//bool MyStack::pop(char& elem)
bool MyStack::pop(Coordinate& 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] << ",";
m_pBuffer[i].printCoordinate();
}
}
else
{
for (int i = m_iTop - 1; i >= 0; i--)
{
//cout << m_pBuffer[i] << ",";
m_pBuffer[i].printCoordinate();
}
}
}
demo.cpp
#include高级—类模板
将普通栈改造为类模板栈，使其可以适用于任何数据类型
MyStack.h
#pragma once
#includeCoordinate.h
#pragma once
#includeCoordinate.cpp
#include"Coordinate.h"
Coordinate::Coordinate(int x, int y)
{
m_iX = x;
m_iY = y;
}
void Coordinate::printCoordinate()
{
cout << "(" << m_iX << "," << m_iY << ")" << endl;
}
ostream& operator<<(ostream& out, Coordinate& coor)
{
cout << "(" << coor.m_iX << "," << coor.m_iY << ")" << endl;
return out;
}
demo.cpp
#include栈应用–进制转换
demo.cpp
#include 对于十六进制还需改进：
demo.cpp
#define BINARY 2
#define OCTONARY 8
#define HEXADECTMAL 16
int main(void)
{
char num[] = "0123456789ABCDEF";
MyStack<int> *pStack = new MyStack<int>(30);
int N = 2016;
int mod = 0;
while (N != 0)
{
mod = N % HEXADECTMAL;
pStack->push(mod);
N = N / HEXADECTMAL;
}
// pStack->stackTraverse(false);
// for (int i = pStack->stackLength() - 1; i >= 0; i--)
// {
// num[pStack[i]]
// }
int elem = 0;
while (!pStack->stackEmpty())
{
pStack->pop(elem);
cout << num[elem];
}
delete pStack;
pStack = NULL;
system("pause");
return 0;
}
应用–括号匹配
#include