代码示例:
#ifndef MYSTACK_H
#define MYSTACK_H
#include<iostream>
using namespace std;
template<typename T>
class MyStack
{
public:
MyStack(int size);//分配内存初始化空间,设定栈容量,栈顶
~MyStack();//回收栈空间内存
bool stackEmpty();//判断栈是否为空,为空返回true,非空返回false
bool stackFull();//判断栈是否为满,为满返回true,非满返回false
void clearStack();//清空栈
int stackLength();//已有元素个数
bool push(T elem);//元素入栈,栈顶上升
bool pop(T &elem);//元素出栈,栈顶下降
void stackTraverse(bool isFromButtom);//遍历栈中的元素
private:
T *m_pBuffer;//栈空间指针
int m_iSize;//栈容量
int m_iTop;//栈顶,栈中元素个数
};
template<typename T>
MyStack<T>::MyStack(int size)
{
m_iSize=size;
m_pBuffer=new T[size];
m_iTop=0;
}
template<typename T>
MyStack<T>::~MyStack()
{
delete[]m_pBuffer;
m_pBuffer=0;
}
template<typename T>
bool MyStack<T>::stackEmpty()
{
if(0==m_iTop)
{
return true;
}
return false;
}
template<typename T>
bool MyStack<T>::stackFull()
{
if(m_iTop==m_iSize)//(m_iTop>=m_iSize)
{
return true;
}
return false;
}
template<typename T>
void MyStack<T>::clearStack()
{
m_iTop=0;
}
template<typename T>
int MyStack<T>::stackLength()
{
return m_iTop;
}
template<typename T>
bool MyStack<T>::push(T elem)
{
if(stackFull())
{
return false;
}
m_pBuffer[m_iTop]=elem;
m_iTop++;
return true;
}
template<typename T>
bool MyStack<T>::pop(T &elem)
{
if(stackEmpty())
{
return false;
}
m_iTop--;
elem=m_pBuffer[m_iTop];
return true;
}
template<typename T>
void MyStack<T>:: 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;
}
}
}
#endif
#include<iostream>
#include"stdlib.h"
#include"MyStack.h"
//#include"Coordinate.h"
using namespace std;
/*
栈应用:
描述:任意输入一组括号,可以判断括号是否匹配
字符串示例[()] {[()()]} {()[()]} {[()]
目的 :通过实例灵活掌握栈机制的使用和技巧
*/
int main()
{
MyStack<char>*pStack=new MyStack<char>(5);//存放字符
MyStack<char>*pNeedStack=new MyStack<char>(5);//记录栈顶所急需的字符
char str[]="{[()]";
char currentNeed=0;
for(int i=0;i<strlen(str);i++)
{
if(str[i]!=currentNeed)
{
pStack->push(str[i]);
switch(str[i])
{
case '[':
if(currentNeed!=0)
{
pNeedStack->push(currentNeed);
}
currentNeed=']';
break;
case '(':
if(currentNeed!=0)
{
pNeedStack->push(currentNeed);
}
currentNeed=')';
break;
case '{':
if(currentNeed!=0)
{
pNeedStack->push(currentNeed);
}
currentNeed='}';
break;
default:
cout<<"括号不匹配"<<endl;
system("pause");
return 0;
}
}
else
{
char elem;
pStack->pop(elem);
if(!pNeedStack->pop(currentNeed))
{
currentNeed=0;
}
}
}
if(pStack->stackEmpty())
{
cout<<"括号匹配"<<endl;
}
else
{
cout<<"括号不匹配"<<endl;
}
delete pStack;
pStack=NULL;
system("pause");
return 0;
}
打印结果: