UVa 673 Parentheses Balance

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>
int main(void)
{
    int n,i,count,len;
    char s[130];
    char stack[130];
    
    scanf("%d",&n);
    getchar();
    while(n--)
    {
     gets(s);
     if(!strlen(s))
     {
      printf("Yes\n");
      continue;
     }
     stack[0]=s[0];
     count=0;
     for(i=1;i<strlen(s);i++)
     {
      len=s[i]-stack[count];
      if(len==1||len==2)
       count--;
      else
      {
       count++;
       stack[count]=s[i];      
      }
     }
     if(count==-1) printf("Yes\n");
     else printf("No\n");
    } 
    return 0;
}