ONP - Transform the Expression
Transform the algebraic expression with brackets into RPN form (Reverse Polish Notation). Two-argument operators: +, -, *, /, ^ (priority from the lowest to the highest), brackets ( ). Operands: only letters: a,b,...,z. Assume that there is only one RPN form (no expressions like a*b*c).
t [the number of expressions <= 100] expression [length <= 400] [other expressions]
Text grouped in [ ] does not appear in the input file.
The expressions in RPN form, one per line.
Input: 3 (a+(b*c)) ((a+b)*(z+x)) ((a+t)*((b+(a+c))^(c+d))) Output: abc*+ ab+zx+* at+bac++cd+^*
AC one go whooo hooo :D
test cases do not check for cases like a^b+c
Please only solve using stack if coding in java c or c++ , DO NOT TRY STRING AND STRINGBUFFERS made it more complicated.
AC on one go :)
No need for a stack, although it's the best way. Take in count the operations listed, because the test cases don't include all of them. Cost me one WA.
if anyone is having any problem, I suggest you study about RPN.
Good for learning stack...
.Last edit: 2016-07-08 09:07:19
Stack 101 AC in one go!!
|Added by:||Michał Małafiejski|
|Cluster:||Cube (Intel G860)|
|Languages:||All except: NODEJS PERL 6 VB.net|