说明：  假设一个算术表达式中可以包含三种括号：园括号“(”和“)”、方括号“[”和“]”、花括号“{”和“}”，且这三种括号可按任意的次序嵌套使用。编写判别给定表达式中所含括号是否正确配对出现的算法（已知表达式已存入数据元素为字符的顺序表中）。要求：顺序栈存储；实现顺序栈的基本操作；调用基本操作完成。
(Suppose an arithmetic expression can contain three kinds of parentheses: the square brackets "(" and") ", the square brackets "[" and"] ", and the curly brackets "{" and"} ", which can be nested in any order. Write an algorithm that determines whether the correct pairing of parentheses in a given expression occurs (the expression is known to have been stored in an order table with data elements as characters). Requirements: sequential stack storage; Achieve the basic operation of the sequence stack; The basic operation is invoked.)