| Parentheses Balance |
You are given a string consisting of parentheses () and []. A string of this type is said to be correct:
Write a program that takes a sequence of strings of this type and check their correctness. Your program can assume that the maximum string length is 128.
The file contains a positive integer n and a sequence of n strings of parentheses () and [], one string a line.
A sequence of Yes or No on the output file.
3
([]) (([()]))) ([()[]()])()
Sample Output
Yes No Yes
#include<cstdio>
#include<stack>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
getchar();
while(n--)
{
char a[130];
stack<char> s;
gets(a);
int flag=0;
for(int i=0;a[i]!='\0';i++)
{
if(a[i]=='('||a[i]=='[')
s.push(a[i]);
else if(a[i]==')')
{
if(!s.empty()&&s.top()=='(') s.pop();
else
{flag=1;break;}
}
else if(a[i]==']')
{
if(!s.empty()&&s.top()=='[')
s.pop();
else {flag=1;break;}
}
}
if(flag||!s.empty()) printf("No\n");
else printf("Yes\n");
}
return 0;
}
版权声明：本文为博主原创文章，未经博主允许不得转载。
原文：http://blog.csdn.net/a1967919189/article/details/46972397