uva673（ Parentheses Balance）—线性表

最新推荐文章于 2021-05-23 11:49:54 发布

原创最新推荐文章于 2021-05-23 11:49:54 发布 · 463 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#uva

uva-线性表专栏收录该内容

6 篇文章

订阅专栏

本文探讨了如何通过编程解决括号平衡问题，包括正则表达式匹配、递归和栈的应用，提供了多种实现方法及其优缺点分析。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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<stdio.h>
#include<string.h>
#define MAX 200
int main(){
	int n;
	char s[MAX];
	int top;
	scanf("%d",&n);
	getchar();
	char c;
	int flag;
	while(n--){
		flag=0;
		top=-1;
		while((c=getchar())!=EOF&&c!='\n'){
			if(top!=-1){
				if(c==']'){
					if(s[top]=='[')
						top--;
					else
						flag=1;
				}
				else if(c==')'){
					if(s[top]=='(')
						top--;
					else 
						flag=1;
				}
				else{
					top++;
					s[top]=c;
				}
			}
			else{
				top++;
				s[top]=c;
			}
		}
		if(top!=-1){
			flag=1;
		}
		if(flag==1)
			printf("No\n");
		else
			printf("Yes\n");
	}
	return 0;
}

Parentheses Balance