UVa673 Parentheses Balance

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,(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


?
1
3
?
1
2
3
([])
(([()])))
([()[]()])()
Sample Output


?
1
2
3
Yes
No
Yes
 


 

#include <iostream>
#include <stack>
#include <map>
using namespace std;
int main(){
	
	int n;
	cin>>n;
	while(n--){
		stack <char> temp1;
		stack <char> temp2;
		map<char,char> kuohao;
		kuohao['(']=')';
		kuohao[')']='(';
		kuohao['[']=']';
		kuohao[']']='[';
		string str;
		cin>>str;
		for(int i=0;i<str.length();i++){
			temp1.push(str[i]);
		}
		temp2.push(temp1.top());
		temp1.pop();
		while(!temp1.empty()&&!temp2.empty()){
			//cout<<temp1.top()<<' '<<temp2.top()<<endl; 
			if(kuohao[temp1.top()]==temp2.top()){
				temp1.pop();
				temp2.pop();
				if(temp2.empty()&&!temp1.empty()){
					temp2.push(temp1.top());
					temp1.pop();
				}
			}
			else{
				temp2.push(temp1.top());
				temp1.pop();
			}	
		}
		
		if(temp1.empty()&&temp2.empty())
			cout<<"Yes"<<endl;
		else
			cout<<"No"<<endl;
	}
	
	return 0;
}