括号配对问题
时间限制:
3000 ms | 内存限制:
65535 KB
难度:
3
-
描述
-
现在,有一行括号序列,请你检查这行括号是否配对。
-
输入
- 第一行输入一个数N(0<N<=100),表示有N组测试数据。后面的N行输入多组输入数据,每组输入数据都是一个字符串S(S的长度小于10000,且S不是空串),测试数据组数少于5组。数据保证S中只含有"[","]","(",")"四种字符 输出
- 每组输入数据的输出占一行,如果该字符串中所含的括号是配对的,则输出Yes,如果不配对则输出No 样例输入
-
3 [(]) (]) ([[]()])
样例输出
-
No No Yes
C++版:
#include<cstdio>
#include<cstring>
using namespace std;
struct stack{
char a[10001];
int top;
}b;
char d[10001];
void push(char c){
b.a[b.top]=c;
b.top++;
}
void pop(char c){
b.top--;
}
int main(){
int n;
scanf("%d",&n);
//cin>>n;
while(n--){
scanf("%s",d);
//cin>>d;
b.top=0;
push(d[0]);
for(int i=1; i<strlen(d); i++){
if(d[i]==')'&&b.a[b.top-1]=='(' || d[i]=='}'&&b.a[b.top-1]=='{' || d[i]==']'&&b.a[b.top-1]=='[' ){
pop(d[i]);
}else{
push(d[i]);
}
}
if(b.top==0){
printf("Yes\n");
//cout<<"Yes"<<endl;
}else{
printf("No\n");
//cout<<"No"<<endl;
}
}
return 0;
}
java版:
import java.util.Scanner;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner input = new Scanner(System.in);
int num = input.nextInt();
int i=0;
String arr[] = new String[num];
for(i=0; i<num; i++){
arr[i] = input.next();
}
i=0;
while(i < num){
String flaot = "No";
int b = to_make(arr[i]);
if(b == 1){
flaot = "Yes";
}
System.out.println(flaot);
i++;
}
}
public static int to_make(String s){
int slen = s.length();
if(slen%2 != 0 && slen > 1) return 0;
if(s.charAt(0) == ')'||s.charAt(0) == '}'||s.charAt(0) == ']') return 0;
char []ch = new char [slen/2];
int j=0; char CA = '-';
for(int i=0; i<slen; i++){
char ca = s.charAt(i);
if(ca == '('||ca == '{'||ca == '['){
ch[j] = ca;
}
else{
if(j<=0) return 0;
if(ca == ')'){
CA = '(';
}
else if(ca == '}'){
CA = '{';
}
else if(ca == ']'){
CA = '[';
}
if(ch[j-1] != CA) return 0;
else{
j -= 2;
}
}
j++;
}
if(j != 0) {
return 0;
}
return 1;
}
}
java的栈运用:
import java.util.Scanner;
import java.util.Stack;
public class kuohao {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n= sc.nextInt();//3条测试数据数据
Stack<Character> stack = null;
while(n!=0){
//从控制台读入一个测试字符串[]() [(])
String str = sc.next();
//如果该输入字符串为奇数,说明不匹配
if(str.length() % 2 == 1){
System.out.println("No");
}else{
//说明字符是偶数
stack = new Stack<Character>();
//遍历第一条测试字符串[]() [(])
for(int i=0;i<str.length();i++){
if(stack.isEmpty()){
//如果栈是空的
stack.push(str.charAt(i));
}else if(stack.peek() == '[' && str.charAt(i) == ']' || stack.peek() == '(' && str.charAt(i) == ')'){
//说明此时栈中字符不是空的,并且符合,
stack.pop();
}else{
stack.push(str.charAt(i));
}
}
if(stack.isEmpty()){
//如果栈是空的,说明括号匹配
System.out.println("Yes");
}else{
//说明栈不为空,括号不匹配
System.out.println("No");
}
}
n--;
}
}
}