栈

假设一个算术表达式中可以包含三种括号：园括号“(”和“)”、方括号“[”和“]”、花括号“{”和“}”，且这三种括号可按任意的次序嵌套使用。编写判别给定表达式中所含括号是否正确配对出现的算法（已知表达式已存入数据元素为字符的顺序表中）。要求：顺序栈存储；实现顺序栈的基本操作；调用基本操作完成。-The stack

Suppose a arithmetic expressions can contain three kind of parentheses: garden \ (\　and\ ) \ , brackets, brackets \ [\　and\ ] \ , curly braces \ {\　and\ } \ , and the three brackets can be used according to the sequence of arbitrary nested. Write discriminant given expression in parentheses is properly matched the algorithm (known expression has been deposited in the data elements for the character sequence in the table). Requirements: order stack storage　To realize the basic operations of stack order　Call the basic operation is completed.