运用栈实现表达式开、闭括号是否配对出现算法。先要实现栈的基本操作算法，包括初始化栈、进栈、退栈等。本程序中，表达式中的元素限定为char型，表达式的长度<100。表达式输入的为一个以“#”为结束标志的字符串。若用户输入的表达式中少了左括号或少了右括号，打印“括号不匹配”。若输入的表达式左右括号匹配，打印“括号匹配”。-Use stack to achieve expression open, close parenthesis pair appeared algorithm. The need to achieve the basic operation of the stack algorithm, including the initialization stack, the stack, the stack back. The program expression elements qualified for the char type expression length < 100. Expression input for a " #"　marks the end of a string. User input expression less left parenthesis less a right parenthesis, print " brackets do not match."　If the input expression left and right parentheses matching, print brace matching.