顺序栈的括号匹配

#include

using namespace std;

const int stacksize=100;
template
class seqstack
{
public:
seqstack(){top=-1;}; //构造函数，初始化一个空栈
//~seqstack(){}; //构造函数为空
void push(t x); //元素x入栈
t pop(); //出栈，将栈顶元素弹出
t gettop(){if(top!=-1)return data[top];}; //取栈顶元素，并不删除
int empty(){return (top==-1?1:0);}; //判断栈是否为空
private:
t data[stacksize]; //存放栈元素的数组
int top; //栈顶指针，为栈顶元素在数组中的下标
};
template
void seqstack::push(t x)
{
if(topstacksize-1)throw"上溢";
data[++top]=x;
};
template
t seqstack::pop()
{
t x;
if(top-1)throw"下溢";
x=data[top–];
return x;
};
bool matching(char exp[]) //括号匹配
{
int state=1,i=0;
char ch,e;
ch=exp[i++];
seqstackS;
while(ch!=’\0’&&state)
{
if(ch==’(’||ch==’[’)S.push(ch);
else
if(ch==’)’)
if(!S.empty()&&S.gettop()’(’)e=S.pop();else state=0;
else if(ch’]’)
if(!S.empty()&&S.gettop()==’[’)e=S.pop();else state=0;
ch=exp[i++];
}
if(state&&S.empty())return 1;
else return 0;
};
int main()
{
seqstack A;
char ch[4]={’)’,’(’,’]’,’[’,};
for(int i=0;i<4;i++)A.push(ch[i]);
cout<<“kuohaopipei”<<endl;
cout<<matching(ch)<<endl;
cout<<"zhandingyuansuwei: "<<endl;
cout<<A.gettop()<<endl;
cout<<"出栈: "<<endl;
for(int i=4;i>0;i–)
cout<<A.pop()<<’ ';
return 0;
}