Parentheses Balance

最新推荐文章于 2021-05-12 09:35:59 发布

原创最新推荐文章于 2021-05-12 09:35:59 发布 · 259 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个用于检查字符串中括号()和[]是否正确配对的C++程序。该程序通过栈来实现括号的匹配验证，并能处理多个字符串输入，判断每个字符串中的括号是否正确闭合。

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

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,

Write a program that takes a sequence of strings of this type and check their correctness. Yourprogram 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 stringa line.

Output

A sequence of ‘Yes’ or ‘No’ on the output file.

Sample Input

([])

(([()])))

([()[]()])()

Sample Output

Yes

#include<iostream>
#include<stack>
#include<cstdio>
using namespace std;
int pd(char a,char b)
{
	if(a=='('&&b==')')
		return 0;
	if(a=='['&&b==']')
		return 0;
	return 1;
}
int tj(char m)
{
	if(m=='['||m=='(')
		return 1;
	return 0;
}
int main()
{
	char s[200];
	int n;
	scanf("%d",&n);
	getchar();
	while(n--)
	{
		stack<char> a;
		gets(s);
		if(s[0]=='\n')
		{
			printf("Yes\n");
			continue;
		}
		for(int i=0;s[i];i++)
		{
			if(a.empty())
				a.push(s[i]);
			else if(pd(a.top(),s[i]))
			{
				if(tj(s[i]))
					a.push(s[i]);
			}
			else
				a.pop();
		}
		if(a.empty())
			printf("Yes\n");
		else
			printf("No\n");
	}
	return 0;
}