Parentheses Balance

最新推荐文章于 2024-02-18 18:32:39 发布

田园园野

最新推荐文章于 2024-02-18 18:32:39 发布

阅读量2.5k

点赞数 3

分类专栏： -------------字符串------------- 文章标签： Parentheses Balance 字符串

本文链接：https://blog.csdn.net/qq_36183935/article/details/70984217

版权

-------------字符串------------- 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

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,

(d)if there are other characters,just ignore it . for example :alksdjfajfaslkf(lskdfjldkjfslkfsdlk)slkdfjlksd 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.

输入

The file contains a positive integer n and a sequence of n strings of parentheses ‘()’ and ‘[]’, one string a line.

输出

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

Sample Input

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

Sample Output

Yes
No
Yes

题意：

括号匹配，栈的思想，只将左括号进栈，如果是左括号，则进栈，如是右括号，则一定与栈顶匹配，若不匹配就是错误的，且最后栈一定为空才行

#include<stdio.h>
#include<string.h>

int main(){
	int n,i,j=0;
	char a[200],S[200];
	scanf("%d",&n);
	getchar();//回车 
	while(n-->0){
		j=0;
		int flag=0;
		gets(a);//输入字符串 
		if(strlen(a)==0){//字符串为空 
			printf("Yes\n");
			continue;
		}
		for(i=0;a[i]!='\0';i++){
			if((a[i]=='(')||(a[i]=='[')){
				S[j++]=a[i];//相当于进栈 
			}
			else if((a[i]==')')||(a[i]==']')){
				if((a[i]==')'&&S[j-1]==a[i]-1)||(a[i]==']'&&S[j-1]==a[i]-2)) j--;//j--相当于出栈 
				else{ 
					flag=1;
					break;
				}
			}
		}
		if(j==0&&flag==0) printf("Yes\n");//栈空且都配对成功 
		else printf("No\n");
	}
}