# E - Parentheses Balance

## E - Parentheses Balance

You are given a string consisting of parentheses () and []. A string of this type is said to be correct:

(a) if it is the empty string

(b) if A and B are correct, AB is correct,

(c) if A is correct, (A) and [A] is correct.

Write a program that takes a sequence of strings of this type and check their correctness. Yourprogram can assume that the maximum string length is 128.

Input

The file contains a positive integer n and a sequence of n strings of parentheses ‘()’ and ‘[]’, one stringa line.

Output

A sequence of ‘Yes’ or ‘No’ on the output file.

Sample Input

3

([])

(([()])))

([()[]()])()

Sample Output

Yes

No

Yes

#include<iostream>
#include<cstdio>
#include<stack>
using namespace std;

int main(void)
{
stack<char> p;
int i,j,n;
scanf("%d",&n);
getchar();
while(n--)
{
string s1;
getline(cin,s1);//(a) if it is the empty string
int len=s1.length();
for(i=0;i<len;i++)
{
if(p.empty())
{
p.push(s1.at(i));
continue;
}
if((p.top()=='('&&s1.at(i)==')')||(p.top()=='['&&s1.at(i)==']'))
{
p.pop();
continue;
}
else
p.push(s1.at(i));
}
if(p.empty())
printf("Yes\n");
else
printf("No\n");
while(!p.empty())
{
p.pop();
}
s1="";
}
return 0;
}

• 评论

• 下一篇
• 上一篇