实验内容：

1．　　问题描述

先定义堆栈的几个基本操作，再设计一主函数利用堆的操作完成以下功能：

假设一个算术表达式中可以包含三种括号：()[]{}，且这三种括号可以按任意次序嵌套使用（如：...[...{...}...[...]...]...(...)）。编写判别给定表达式中所含括号是否正确配对出现的算法，已知表达式已存入数据元素为字符的顺序表中。

2．　　基本要求

读入2个不同的、长度不超过80个字符的、包含三种括号的算术表达式，输出测试结果。-Experiment: 1. Descr iption of the problem to define a few basic operation of the stack, and then design a main function of the use of heap operations to accomplish the following functions: Suppose an arithmetic expression can contain three kinds of brackets :()[]{}, and three brackets can be arbitrary order of nested (such as :...[...{...}...[...]...]...(...))。 The preparation of distinguishing a given expression contained in the brackets appear correctly matching algorithms, data elements are known expression for the characters had been deposited into the order table. 2. The basic requirement read into the two different length of no more than 80 characters, contains three kinds of parentheses in arithmetic expressions, the output test results.