D - Parentheses Balance寒假练习1-D

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
来源：UVA673
解题思路：匹配串水题，直接判断是不是所有括号都对应，并企鹅只有2中括号，没有其他特殊符号，如果所有括号匹配就输出“YES”，否则输出“NO”。
代码：

#include<stdio.h>
#include<string.h>
int main()
{
    int n,v,l,j,f;
    char s[1010],s1[1010];
    scanf("%d",&n); getchar();
    while(n--)
    {
        v=-1;
        f=0;

        gets(s);

        l=strlen(s);
        if(l==0)
        printf("Yes\n");
        else
        {


        j=0;
        for(int i=0;i<l;i++)
        {
            s1[j]=s[i];
            if(s1[j]==')')
            {
                if(s1[j-1]=='(')
                j-=2;
                else
                break;
            }
            if(s1[j]==']')
            {
                if(s1[j-1]=='[')
                j-=2;
                else
                break;
            }
            j++;
            if(i==l-1&&j==0)
            f=1;

        }
        if(f==1)
        printf("Yes\n");
        else
        printf("No\n");}
    }
    return 0;
}

错误解析：
输入比较坑，要用到gets，因为每一行算一个串，空行也算。