-
输入
- 第一行输入一个数N(0<N<=100),表示有N组测试数据。后面的N行输入多组输入数据,每组输入数据都是一个字符串S(S的长度小于10000,且S不是空串),测试数据组数少于5组。数据保证S中只含有"[", "]", "(", ")" 四种字符 输出
- 每组输入数据的输出占一行,如果该字符串中所含的括号是配对的,则输出Yes,如果不配对则输出No 样例输入
-
3 [(]) (]) ([[]()])
样例输出
-
No No Yes
学过栈,就知道这道题应该用栈解决,附上代码:
#include <iostream>
#include <stack>
#include<string>
using namespace std;
// 判断字符是不是左括号类型
bool isLeft(char c)
{
return (c == '(' || c == '[' || c == '{');
}
// 判断右括号与左括号是否匹配
bool isMatch(char right, char left)
{
if (left == '(')
{
return (right == ')');
}
if (left == '[')
{
return (right == ']');
}
if (left == '{')
{
return (right == '}');
}
}
// 判断字符串是否匹配
bool matching(char* s)
{
stack<char> cs;
char c;
while (*s)
{
c = *s;
if (isLeft(c))
{
cs.push(c);
}
else
{
if (cs.empty() || !isMatch(c, cs.top()))
{
return false;
}
cs.pop();
}
++s;
}
if (!cs.empty())
{
return false;
}
return true;
}
int main()
{
int n;
cin>>n;
//char s[10000];
string s;
int i=1;
int flag[100];
while(i<=n)
{
cin>>s;
if (matching(&s[0]))
flag[i]=1;
else
flag[i]=0;
i++;
}
i=1;
while(i<=n)
{
if(flag[i]==0) cout<<"No"<<endl;
else cout<<"Yes"<<endl;
i++;
}
return 0;
}
但是,作为初学者,我想到的是下面这种,用条件判断,但if的条件很复杂,能通过题目上的测试数据,但不能判断( [ ( [ ] ) ] ) ( )类似的情况;反正这种思路很麻烦,但还是有一定意义的,也附上代码:
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
cin>>n;
string s;
int l;
int high,low;
int flag[100];
int i=1;
while(i<=n)
{
cin>>s;
l=s.length();
low=0;
high=l-1;
while(low<high)
{
if(high-low<=3)
{
if((s[low]=='[' && s[low+1]==']' && s[high]==')' && s[high-1]=='(') || (s[low]=='(' && s[low+1]==')' && s[high]==']' && s[high-1]=='['))
{flag[i]=1;
break;}
}
if(s[low]=='(' && s[high]==')' || s[low]=='[' && s[high]==']')
{
low++;
high--;
}
else break;
}
if(low<=high && flag[i]!=1) flag[i]=0;
else flag[i]=1;
i++;
}
i=1;
while(i<=n)
{
if(flag[i]==1)
cout<<"Yes"<<endl;
else cout<<"No"<<endl;
i++;
}
return 0;
}