搜索资源列表
khss
- 数据结构：带括号的算术表达式求值。能完成一位数的带括号的算术表达式的运算，结果可以为多位数。用栈实现中缀表达式和后缀表达式的转换。-data structure : the bracketed arithmetic expression is evaluated. Complete with a number of brackets arithmetic expression Operational results for the multi-digit number. With Stack I
zhan-op
- 栈的操作与应用 定界符配对检查 中缀转后缀并求值-stack operation and application delimiter matching inspection superintendent to seek value and Suffix
Cpp2
- 程序是把中缀表达式转化成后缀表达式，并通过后缀表达式进行表达式的计算，通过栈试验代码的程序。
expression
- 表达式求值:利用栈操作实现由中缀表达式到后缀表达式的转换,再求值.
khss_Debug
- 带括号的算术表达式计算器．能完成一位数的带括号的算术表达式的运算，结果可以为多位数。用栈实现中缀表达式和后缀表达式的转换。-bracketed arithmetic expression calculator. Complete with a number of brackets arithmetic expression Operational results for the multi-digit number. With Stack Implementation grade express
表达式转换求值 C++
- 表达式的转换求值 利用栈 中缀表达式转后缀 直接将扩展名转为CPP即可调试运行
expression
- 用C语言版 编写一个表达式求值演算的 算法程序 要求：使用栈，需要将算法的过程显示出来 ，输入一连串算术值 如：2*（3+2）# 然后 显示出算术过程 和结果！先将输入的中缀 转换后缀 再求值 程序中使用两个栈！ 可以在VC++ 中运行- A linear epitope recognized by both MAbs,c2410 and WH303,which has strong specificity of CSFV,has been precisely defined and l
FomulaStack
- 利用栈求解算术表达式的值，程序分为两种表达式，中缀式与后缀式，分别得用栈先入后出的特性，以及运算符的优先级比较，进行求解-use arithmetic to solve the value of the expression, procedures are divided into two expressions, and the sergeant-type suffix. Stack were starting after the first-in-the characteristics, a
中缀转后缀的程序
- 将中缀表达式转化为后缀表达式，并计算它的值，采用栈结构，实现运算
calc
- 自己写的一个24点小游戏，其中用栈实现了中缀和后缀表达式求值，可以加以借鉴-Himself wrote a 24-point game, which used a stack infix and suffix expression evaluation can be draw
biaodashijisuan
- 表达式计算，用栈实现，可实现中缀转后缀，表达式值的计算等功能-Expression, the use of the stack to achieve, can be achieved in up to suffix, expression value calculation and other functions
1
- 实现中缀表达式转后缀表达式，并利用后缀表达式求值-Infix expression to expression algorithm suffix
Expression
- 把中缀表达式转换为后缀表达后，求表达式的结果。用到栈和队列-Infix expression to convert the expression of suffix, and the results of expressions. Used stack and queue
Stack
- 栈的定义，C++定义的栈的基本操作 用于栈的操作练习 表达式求值，中缀转后缀-Stack
calculator
- 用栈实现简单计算器功能。中缀转后缀表达式-Simple calculator using stack functions. Expression infix to suffix
transform
- 输入表达式的中缀表达形式，通过编程（借助栈）实现中缀表达式到后缀表达式的转换-Input infix expression forms of expression, through the program (with stacks) infix expression to achieve expression of the conversion suffix
expressions
- 有关表达式的栈的应用 内容有：表达式括号匹配 计算后缀表达式的值 计算算术表达式的值 中缀表达式转后缀表达式-Expression of the application stack are as follows: the expression in brackets to match the calculated value of the suffix arithmetic expression expression is made up of expressions of
ExpressionTest
- 中缀表达式转后缀表达式基本思路是：用一个链表 List 储存将要生成的后缀表达式；用一个栈 Stack 储存操作符；判断当前节点， 如果是操作数， 直接加入后缀表达式中， 如果是操作符，则比较前一个操作符和当前操作符的优先级…… -Infix expression basic idea is to switch to postfix expression: list List with a store that will be generated by postfix expression
PostTest
- 将给定的中缀表达式转化成后缀表达式,利用栈, 将运算符不断的相比较其优先级来进行表达式的生成(Given the infix expression into postfix expression)
中缀转后缀
- 栈的应用：在四则运算中序式转后续式的基础上，利用栈的帮助完成后序式的计算，并输出结果。(Application of stack: in the four operations, in order to follow up the follow-up, based on the help of the stack to complete the sequent calculation, and output the results.)