搜索资源列表
suffix
- 实现中缀表达式到后缀表达式的转换,并求值-Midfix turn to suffix and solve it
stack
- 使用堆栈写的表达式中缀转后缀,并且计算表达式的值,可支持多位数和四则运算。-Written expression using stack switch infix suffix, and the calculated value of the expression, can support more than the median and arithmetic.
lab1
- 数据结构,中缀表达式转后缀表达式并求值 用链表构造堆栈实现-in-post
rpn
- 中缀表达式转后缀,生产表达式二叉树并在控制台中画出 -Switch to postfix infix expression, production and expression binary tree drawn in the console
source
- 数据结构,线性表的应用(简单仓库管理)和栈的应用(中缀表达式转后缀表达式)-Data structures, application of linear forms (a simple warehouse management) and applications of stack (switch to postfix infix expression expression)
expression
- 实验要求把中缀表达式转换成为后缀表达式,然后再对后缀表达式求值。其中要利用栈,数组等。-Experimental requirements to convert infix expression into postfix expression and then evaluate the expression of the suffix. Which make use of the stack, the array and so on.
main
- 输入中缀表达式 输出后缀表达式 并求值-Input infix expression postfix expression and evaluates the output
Expression-and-derivation
- 以字符序列的方式从终端输入语法正确的,不含变量的整数表达式。利用中缀表达式变为后缀表达式的求值算法实现对算术四则混合运算表达式求值,并演示出在求值中运算符栈,操作数栈,输入字符和主要操作的变化过程。-The way to sequence of characters from the terminal input grammar correctly, do not contain variables integer expression. Use midfix expression of the
expression
- 中缀表达式->后缀表达式->计算结果值 的源码-Infix expression-> postfix expression-> value of the source results
zhan
- 栈的中缀表达式转为后缀表达式,并计算后缀表达式-Stack infix expression into postfix expression, and calculate the suffix expressions
1
- 输入表达式 建立二叉树 通过周游 输出 中缀后缀前缀表达式-Enter the expression to establish a binary tree output by traveling prefix infix postfix expression
shuzhizhuanhuan
- 表达式是数据运算的基本形式。人们的书写习惯是中缀式,如:11+22*(7-4)/3。中缀式的计算按运算符的优先级及括号优先的原则,相同级别从左到右进行计算。表达式还有后缀式(如:22 7 4 - * 3 / 11 +)和前缀式(如:+ 11 / * 22 – 7 4 3)。后缀表达式和前缀表达式中没有括号,给计算带来方便。如后缀式计算时按运算符出现的先后进行计算。本设计的主要任务是进行表达式形式的转换及不同形式的表达式计算。-Expression is the basic form of dat
suffix
- c++数据结构应用 栈实现中缀表达式转后缀表达式-Middle expression converts to suffix expression in c++
zhongzhui
- 通过栈实现将表达式转换为后缀,并可以计算中缀表达式和后缀表达式的求值-Through the stack to achieve the expression into postfix, and infix expressions can be calculated and postfix expression evaluation
caculator
- 用户输入四则运算的中缀表达式(可包含小括号),程序首先将中缀表达式转为后缀表达式并输出,然后计算结果并输出。-User input of infix arithmetic expression (which can include parentheses), the program first infix expression to postfix expression and the output, then the results and outputs.
stack
- 此程序算法主要实现中缀表达式转换为后缀表达式,后缀表达式的计算,主要利用栈的性质。-The main achievement of this program algorithm infix expressions into postfix expressions, postfix expression is evaluated, the main advantage of the nature of the stack.
Maths
- 中缀表达式转换后缀表达式,并负值使其算出结果-Infix expression into postfix expression, and negative results to calculate
01
- 一个简单的程序,中缀表达式变后缀表达式并计算-zhongzhui into houzhui
MyCalculator
- 实现中缀表达式转后缀表达式 能进行+,-,*,/,()的运算的计算器 使用数据结构堆栈-Switch to postfix infix expression to achieve expression Computing can be+,-,*,/,() calculator Stack data structure using
STACK
- 对数据结构中堆栈的巩固。实现中缀表达式转后缀表达式的编码实现。并计算结果。有注释。-In data structures, the consolidation of the stack. Realize midfix expression of coding realize turn suffix expression. And the computational results. Have comments.