uva 673 Parentheses Balance

本文主要是介绍uva 673 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. Your
program 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 string
a line.
Output
A sequence of ‘Yes’ or ‘No’ on the output file.
Sample Input
3
([])
(([()])))
([()])()
Sample Output
Yes
No
Yes
中文：
就是括号匹配问题。注意数据要一行一行读！

#include <bits/stdc++.h>
using namespace std;int main()
{
//  ios::sync_with_stdio(false);int t;stack<char> sc;scanf("%d",&t);getchar();char s[1000];while(t--){gets(s);int len=strlen(s);if(len==0){printf("Yes\n");continue;}if(len%2){printf("No\n");continue;}while(!sc.empty())sc.pop();int i=0;while(i!=len){if(sc.empty())sc.push(s[i]);else{if((sc.top()=='('&&s[i]==')')||(sc.top()=='['&&s[i]==']'))sc.pop();elsesc.push(s[i]);}i++;}if(sc.empty())printf("Yes\n");elseprintf("No\n");}return 0;
}

解答：
我被这题wa了5次，空串处理的时候一定要一行一行度，不能是字符串为0那样判断！
剩下的就是栈的模拟就可以了

这篇关于uva 673 Parentheses Balance的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---