UVa 673 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,
© 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
之前用scanf("%s")总是WA，不知道输入里面有什么玄学问题，改成gets()就AC了
用栈来判断括号匹配（栈的典型应用）
左括号入栈，遇右括号出栈匹配

#include <stdio.h>
#include <stack>
using namespace std;
bool fuck()
{
    char bracket[256];
    stack<char> s;
    gets(bracket);
    for(int i=0; bracket[i]; i++)
    {
        if(bracket[i]=='('||bracket[i]=='[')
            s.push(bracket[i]);
        else if(!s.empty()&&bracket[i]==')'&&s.top()=='(')
            s.pop();
        else if(!s.empty()&&bracket[i]==']'&&s.top()=='[')
            s.pop();
        else
            return false;
    }
    if(s.empty())
        return true;
    return false;
}
int main()
{
    int n;
    while(~scanf("%d\n",&n))
        while(n--)
            printf("%s\n",fuck()?"Yes":"No");
    return 0;
}