Parentheses Balance UVA

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. Note that the string can contain arbitrary spaces and it can even be empty.

Output

A sequence of Yes or No on the output file.

Sample Input

3

([])

(([()])))

([()[]()])()

Sample Output

Yes

No

Yes

HINT

栈操作

Accepted

#include<bits/stdc++.h>

using namespace std;

int main() {

	ofstream fcout;

	fcout.open("temp.txt");

	int sum, flag = 0;

	string s;

	cin >> sum;getchar();

	while (sum--) {

		stack<char>S;

		flag = 0;

		getline(cin, s);

		for (int i = 0;i < s.length();i++) {

			if (s[i] == '['|| s[i] == '(')S.push(s[i]);

			else if (s[i] == ')')

				if (!S.empty() && S.top() == '(')S.pop();

				else { flag = 1;break; }

			else if (s[i] == ']')

				if (!S.empty() && S.top() == '[')S.pop();

				else { flag = 1;break; }

		}

	cout << (S.empty() && !flag ? "Yes" : "No") << endl;

	}

}

巴特西

Parentheses Balance UVA - 673