Read the infix expression from left to right, one character at a time.
从左到右读入中缀表达式，每次一个字符。
Read the infix expression from left to right , one character at a time.
从左到右读入中缀表达式，每次一个字符。
The conversion process involves reading the operands, operators, and parentheses of the infix expression using the following algorithm.
转换过程包括用下面的算法读入中缀表达式的操作数、操作符和括号。
The operands are in the same order that they would be in the equivalent infix expression.
操作数的顺序与等价的中缀表达式中操作数的顺序一致。
Requirements of the post-conversion infix expression in brackets should not be unnecessary.
要求转换后的中缀表达式中不应出现不必要的括号。
Requirements of the post-conversion infix expression in brackets should not be unnecessary.
要求转换后的中缀表达式中不应出现不必要的括号。
应用推荐