题目来源:http://acm.nyist.net/JudgeOnline/problem.php?pid=2
描述-
输入
- 第一行输入一个数N(0<N<=100),表示有N组测试数据。后面的N行输入多组输入数据,每组输入数据都是一个字符串S(S的长度小于10000,且S不是空串),测试数据组数少于5组。数据保证S中只含有"[","]","(",")"四种字符 输出
- 每组输入数据的输出占一行,如果该字符串中所含的括号是配对的,则输出Yes,如果不配对则输出No 样例输入
-
3 [(]) (]) ([[]()])
样例输出
-
No No Yes
package test;
import java.io.BufferedInputStream;
import java.util.Scanner;
import java.util.Stack;
public class NT002 {
public static void main(String[] args) {
Scanner cin = new Scanner(new BufferedInputStream(System.in));
int N = cin.nextInt();
while(N--!=0){
Stack<Character> stack = new Stack<Character>();
char ch[] = cin.next().toCharArray();
boolean flag=true;
for(char c : ch){
if(c=='('||c=='[')
{
stack.push(c);
}
else if(c==')')
{
if(stack.isEmpty() || stack.peek()!='('){
flag=false;
break;
}
stack.pop();
}
else if(c==']')
{
if(stack.isEmpty() || stack.peek()!='['){
flag=false;
break;
}
stack.pop();
}
}
if(flag && stack.isEmpty())
System.out.println("Yes");
else
System.out.println("No");
}
}
}