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.

(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");} }

總結

以上是生活随笔為你收集整理的Parentheses Balance的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內容還不錯，歡迎將生活随笔推薦給好友。