文件名称:stack
介绍说明--下载内容均来自于网络,请自行研究使用
假设一个算术表达式中可以包括三种括号:圆括号“(”和“)”,方括号“[”和“]”和花括号“{”和“}”且这三种括号可以按任意的次序嵌套使用(如:…[…{…}…[…]…]…[…]…(…)…)。编写判别给定表达式中所含括号是否正确配对出现的算法(已知表达式已存入数据元素为字符的顺序表中)-Suppose an arithmetic expression can include three types of brackets: parentheses " (" and " )" , in square brackets " [" and " ]" and braces " {" and " }" and this can be any of three brackets order of nested (such as: ... [... {...} ... [...] ...] ... [...] ... (...) ...). The preparation of discrimination contained in the given expression appears in parentheses matching algorithm is correct (known expression for the character data elements have been deposited in the order form)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
stack.c