括号配对算法

#include

#include

using namespace std;

int main()

{

stacks;

char str[30];

int i=0;

char input;

bool match;

cout<<"please input until '-'"<

cin>>input;

while(input!='-'){

str[i++]=input;

cin>>input;

}

for(i=0;i<10;i++){

if(str[i]=='('||str[i]=='{'){

s.push(str[i]);

}

else if(str[i]==')'){

if(!s.empty()&&s.top()=='(')s.pop();

else {

match=false;

}

}

else if(str[i]=='}'){

if(!s.empty()&&s.top()=='{')s.pop();

else {

match=false;

}

}

}

if(s.empty()&&match==true)

cout<<"括号配对！"<

else cout<<"括号不配对"<

return 0;

}