C++ 建立棧 判斷括號是否正確
阿新 • • 發佈:2018-12-26
#include<iostream>
#include<string>
using namespace std;
class SqStack
{
private:
char *base;
int top;
int stacksize;
public:
SqStack(int m);
~SqStack(){ delete [] base;top=-1;stacksize=0;};
void push(char e);//入棧
void pop();//出棧
char gettop();//獲取棧頂元素
bool empty();//判棧空
void StackPrintf();
};
SqStack::SqStack(int m)
{
stacksize=m;
top=-1;
base=new char[m];
};
void SqStack::push(char e)
{
if(top==stacksize-1)
{
cout<<"棧滿";
return;
}
top++;
base[top]=e;
};
void SqStack::pop()
{
if(top==-1)
{
cout<<"棧空";
return ;
}
top--;
};
char SqStack::gettop()
{
return base[top];
};
bool SqStack::empty()
{
if(top==-1)
{
return true;
}
else
{
return false;
}
};
void SqStack::StackPrintf()
{
int num=top;
while(num>=0)
{
cout<<base[num--]<<"->"<<'\n';
}
}
int main()
{
while(true){
SqStack s(10);
bool state=true;
string exp;
cin>>exp;
for(int i=0;i<exp.length()&&state;i++)
{
switch(exp[i])
{
case '(':
{
s.push('(');break;
}
case ')':
{
if(!s.empty()&&s.gettop()=='(')
{
s.pop();
break;
}else
{
state=false;
break;
}
}
case '[':
{
s.push('[');break;
}
case ']':
{
if(!s.empty()&&s.gettop()=='[')
{
s.pop();
break;
}else
{
state=false;
break;
}
}
case '{':
{
s.push('{');break;
}
case '}':
{
if(!s.empty()&&s.gettop()=='{')
{
s.pop();
break;
}else
{
state=false;
break;
}
}
}
}
if(s.empty()&&state)
{
cout<<"正確";
}
else
{
cout<<"錯誤";
}
}
return 0;
}
#include<string>
using namespace std;
class SqStack
{
private:
char *base;
int top;
int stacksize;
public:
SqStack(int m);
~SqStack(){ delete [] base;top=-1;stacksize=0;};
void push(char e);//入棧
void pop();//出棧
char gettop();//獲取棧頂元素
bool empty();//判棧空
void StackPrintf();
};
SqStack::SqStack(int m)
{
stacksize=m;
top=-1;
base=new char[m];
};
void SqStack::push(char e)
{
if(top==stacksize-1)
{
cout<<"棧滿";
return;
}
top++;
base[top]=e;
};
void SqStack::pop()
{
if(top==-1)
{
cout<<"棧空";
return ;
}
top--;
};
char SqStack::gettop()
{
return base[top];
};
bool SqStack::empty()
{
if(top==-1)
{
return true;
}
else
{
return false;
}
};
void SqStack::StackPrintf()
{
int num=top;
while(num>=0)
{
cout<<base[num--]<<"->"<<'\n';
}
}
int main()
{
while(true){
SqStack s(10);
bool state=true;
string exp;
cin>>exp;
for(int i=0;i<exp.length()&&state;i++)
{
switch(exp[i])
{
case '(':
{
s.push('(');break;
}
case ')':
{
if(!s.empty()&&s.gettop()=='(')
{
s.pop();
break;
}else
{
state=false;
break;
}
}
case '[':
{
s.push('[');break;
}
case ']':
{
if(!s.empty()&&s.gettop()=='[')
{
s.pop();
break;
}else
{
state=false;
break;
}
}
case '{':
{
s.push('{');break;
}
case '}':
{
if(!s.empty()&&s.gettop()=='{')
{
s.pop();
break;
}else
{
state=false;
break;
}
}
}
}
if(s.empty()&&state)
{
cout<<"正確";
}
else
{
cout<<"錯誤";
}
}
return 0;
}