UVA - 673：Parentheses Balance

Parentheses Balance

标签：

来源：

参考资料：

相似题目：

题目

You are given a string consisting of parentheses () and []. A string of this type is said to be correct:
l if it is the empty string
l if A and B are correct, AB is correct,
l 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.

输入

The file contains a positive integer n and a sequence of n strings of parentheses ‘()’ and ‘[]’, one string a line.