栈的应用：括号匹配.即先建立一个栈（这里采用顺序栈），把左括号压入栈中，只有碰到匹配的右括号时出栈，否则则是不匹配，当栈中没有元时，匹配成功。-Stack of applications: matching bracket. The first to create a stack in a sequential stack (here), the left parenthesis pressure into the stack, only touching the matching bracket right out of the stack, it is not match, when the stack not yuan, the match is successful.