Parentheses Balance （栈）

Time Limit:3000MS    Memory Limit:0KB    64bit IO Format:%lld & %llu

Description

(a)You are given a string consisting of parentheses () and []. A string of this type is said to becorrect:

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

  一开始想的太简单了，就数了一下（）[]的数目看是否相等，结果wro了，突然明白  ）））（（（ 这种情况也不行，菜鸡啊！

思路： 还是栈，注意([)]这种情况是不行的

写就写呗，交了好几次，又wro了，草，for循环的i忘赋初值0了

   代码：

不能用scanf，要用gets，因为scanf'不能接收\n，但gets可以

#include<iostream>
#include<stack>
#include<cstring>
using namespace std;
int main()
{
	int n;
	char s[150];
	cin>>n;
	getchar();
	while(n--)
	{
	    gets(s);
		stack<char> st;
		while(!st.empty()) st.pop();
		
		int len=strlen(s);
		for(int i=0;i<len;i++)
		{
			if(s[i]=='('||s[i]=='[') st.push(s[i]);
			else
			{
				if(st.size() && s[i]==')' && st.top()=='(')      st.pop();
				else if(st.size() && s[i]==']' && st.top()=='[') st.pop();
				else st.push(s[i]);
			} 
		}
		if(st.size()==0)
		  cout<<"Yes"<<endl;
		else
		  cout<<"No"<<endl;
	}
	return 0;
}