Evaluate the value of an arithmetic expression in Reverse Polish Notation.
Valid operators are +
, -
, *
, /
. Each operand may be an integer or another expression.
Some examples:
["2", "1", "+", "3", "*"] -> ((2 + 1) * 3) -> 9 ["4", "13", "5", "/", "+"] -> (4 + (13 / 5)) -> 6
思路:运用栈解决逆波兰式的计算问题,也是最经典的栈的应用题型,根据逆波兰式(也叫后缀表达式)的特征,每遇到一个算术符,从栈中弹出两个进行计算,将产生的值重新压入栈即可,下面演示第一个例子的过程
2 进栈
1 进栈
碰到了+号,弹出两个2 1,得出为3,将3进栈,
碰到3 进栈
碰到*号,弹出两个3,得出9,将9进栈
结束,栈中的9即是结果
代码如下(已通过leetcode)
public class Solution {
public int evalRPN(String[] tokens) {
Stack<String> stack=new Stack<String>();
for(String s:tokens) {
if(s.equals("+")||s.equals("-")||s.equals("*")||s.equals("/")) {
int dig2=Integer.parseInt(stack.pop());
int dig1=Integer.parseInt(stack.pop());
switch(s){
case "+":
stack.push(""+(dig1+dig2));
break;
case "-":
stack.push(""+(dig1-dig2));
break;
case "*":
stack.push(""+(dig1*dig2));
break;
case "/":
stack.push(""+(dig1/dig2));
break;
}
} else {
stack.push(s);
}
}
return Integer.parseInt(stack.pop());
}
}