计算逆波兰式(后缀表达式)的值
运算符仅包含"+","-","*"和"/",被操作数可能是整数或其他表达式
例如:
["2", "1", "+", "3", "*"] -> ((2 + 1) * 3) -> 9↵ ["4", "13", "5", "/", "+"] -> (4 + (13 / 5)) -> 6
思路:用栈从头开始依次压入数组中的数字,遇到运算符时弹出前两个数字进行计算,计算结果再压入栈中,直至数组全部遍历,弹出栈内数字为最终计算结果:
import java.util.*;
public class Solution {
public int evalRPN(String[] tokens) {
if(tokens==null)
return 0;
Stack<Integer> stack=new Stack<Integer>();
int num1,num2;
for(int i=0;i<tokens.length;i++){
if(tokens[i].equals("+")||tokens[i].equals("-")||tokens[i].equals("*")||tokens[i].equals("/")){
if(tokens[i].equals("+")&&stack.size()>1){
num1=stack.pop();
num2=stack.pop();
num2=num2+num1;
stack.push(num2);
}
else if(tokens[i].equals("-")&&stack.size()>1){
num1=stack.pop();
num2=stack.pop();
num2=num2-num1;
stack.push(num2);
}
else if(tokens[i].equals("*")&&stack.size()>1){
num1=stack.pop();
num2=stack.pop();
num2=num2*num1;
stack.push(num2);
}
else if(tokens[i].equals("/")&&stack.size()>1){
num1=stack.pop();
num2=stack.pop();
num2=num2/num1;
stack.push(num2);
}
else{
return 0;
}
}
else{
stack.push(Integer.parseInt(tokens[i]));//数字字符串转int型
}
}
return stack.pop();
}
}