UVA-673 Parentheses Balance（栈）

# include<iostream>
# include<cstdio>
# include<stack>
# include<cstring>
# include<algorithm>
using namespace std;

char p[130];
stack<char>s;

bool judge()
{
    int len=strlen(p);
    if(len==0)
        return true;

    while(!s.empty())
        s.pop();
    for(int i=0;i<len;++i){
        if(p[i]==‘(‘||p[i]==‘[‘)
            s.push(p[i]);
        else{
            if(s.empty())
                return false;
            char c=s.top();
            if(c==‘(‘&&p[i]!=‘)‘)
                return false;
            if(c==‘[‘&&p[i]!=‘]‘)
                return false;
            s.pop();
        }
    }
    return s.empty();
}

int main()
{
    int T;
    scanf("%d",&T);
    getchar();
    while(T--)
    {
        gets(p);
        if(judge())
            printf("Yes\n");
        else
            printf("No\n");
    }
    return 0;
}