Parentheses Balance（673）

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

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

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #stl

UVA 专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一种使用堆栈数据结构来验证括号序列正确性的算法。该算法能够判断由圆括号()和方括号[]组成的字符串是否符合正确的配对规则。通过逐个检查输入字符串中的字符，并利用堆栈进行匹配检查，可以有效地解决括号匹配问题。

摘要生成于 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,

(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.

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

Sample Output

Yes
No
Yes

注：用堆栈，是(,[就入栈，),]就出栈
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <list> 
#include <map> 
#include <string>
using namespace std; 
#define infinity 2147483647
int gcd(int a,int b)
{
	return b==0?a:gcd(b,a%b);
}

int main()
{
	int n,i,l,flag;
	char s[1000];
	stack<char>ss;
	while(scanf("%d",&n)!=EOF)
	{
		getchar();
		while(n--)
		{
			gets(s);
			
			while(!ss.empty())
			{
				ss.pop();
			}
			
			flag=1;
			l=strlen(s);	
			for(i=0;i<l;i++)
			{
				if(s[i]=='(' || s[i]=='[')
				ss.push(s[i]);
				else if(s[i]==')')
				{
					if(ss.empty())
					{
						flag=0;
						break;
					}
					else if(ss.top()=='(')
					ss.pop();
					else
					{
						flag=0;
						break;
					}
				}	
				else if(s[i]==']')
				{
					if(ss.empty())
					{
						flag=0;
						break;
					}
					else if(ss.top()=='[')
					ss.pop();
					else
					{
						flag=0;
						break;
					}
				}
			}
			if(flag && ss.empty())
			cout <<"Yes" <<endl;
			else
			cout <<"No" <<endl;			
		}
	}	
			
	return 0;
}