一道关于栈的问题:
题目链接如下:http://vjudge.net/problem/UVA-673;
根据模型很容易想到用栈实现,下面贴出代码:
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<stack>
#include<string>
using namespace std;
//判断括号是否匹配
int judge(char a, char b){
int key = 0;
if (a == '('&&b == ')') key = 1;
else if (a == '['&&b == ']') key = 1;
return key;
}
int main()
{
string str;
int n;
cin>>n;
getchar();
while(n--){
stack<char> s;
int flag = 1;
getline(cin, str);
if (str.size()%2 == 0){
for (int i = 0; i < str.size(); i++){
//输入左括号压栈
if (str[i] == '('||str[i] == '['){
s.push(str[i]);
}
//输入右括号时将栈顶元素进行匹配
else if (!s.empty()&&judge(s.top(), str[i])){
s.pop();//匹配成功则弹出栈顶元素
}
else {
flag = 0;
break;
}
}
}
else flag = 0;//数目为奇数必然不符题意
if (flag&&s.empty()) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}