160. Infix to Postfix
Challenge1000 ms256 MBSolved by 0%
Convert an ordinary infix expression into postfix notation.
Read one line containing single lowercase letters as operands, the operators + - * /,
and brackets. Print the postfix form with a single space between tokens.
* and / bind more tightly than + and -. Operators of equal precedence group from
left to right, so a-b-c becomes a b - c -.
Constraints - The line has between 1 and 100000 characters. - Operands are single lowercase letters. - Brackets are always balanced.
Input
A single line containing single lowercase letters as operands, the operators + - * /, and balanced brackets.
Output
Print the postfix form with a single space between tokens.
Inputa+b
Outputa b +
Noteis the simplest conversion
Inputa+b*c
Outputa b c * +
Noterequires the tighter-binding operator to be emitted first
Hints
Four rungs, in order. The last two open once you have submitted an attempt. A wrong one counts.
Hint 1Where to start
Hint 2The approachOpen hint 1 first. This one carries on from it.
Hint 3PseudocodeOpen hint 2 first. This one carries on from it.
Hint 4Full solutionOpen hint 3 first. This one carries on from it.