UVA——673 Parentheses Balance

题目：

         Parentheses Balance

Problem Description

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

(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
           

题目描述：

         括号匹配问题，用栈来写的，比较坑的是，当读入空行时要判为Yes。当时我用的scanf,然后就用%c读的，再手动把换行符换成\0。

解题代码：