uva673

题目：
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

思路：括号匹配。。将左括号放入栈中，遇到右括号就进行匹配。。如果匹配了就pop出来 如果不匹配就是不匹配。。到字符串尾巴的时候还要判断栈中是否已经为空，不为空表示有左括号多出来。

代码：

#include <iostream>
#include <string>
using namespace std;
#include <stack>
int main()
{
    string s;
    int m, i;
    cin >> m;
    stack<char> ss;
    getchar();
    while (m--)
    {
        getline(cin, s);
        for (i = 0; i< s.length(); i++)
        {
            if (s[i] == '(' || s[i] == '[')
                ss.push(s[i]);
            if (ss.empty())
                break;
            else if (s[i]==')')
            {
                if (ss.top() == '(' )
                {
                    ss.pop();
                }
                else
                    break;
            }
            else if (s[i]==']')
            {
                if (ss.top() == '[' )
                {
                    ss.pop();
                }
                else
                    break;
            }
        }

        if (i==s.length() && ss.empty())
            printf("Yes\n");
        else
            printf("No\n");
        while (!ss.empty())
            ss.pop();
    }
    return 0;
}