LeetCode150 逆波兰表达式求值
思路:用栈来模拟计算过程,若当前元素为数字则压入栈中,若为计算符则弹出两个数进行计算,注意"-“和”/"的时候弹出数的顺序
class Solution {
public int evalRPN(String[] tokens) {
Stack<Integer> stack = new Stack<>();
for(int i = 0; i < tokens.length; i++){
if(tokens[i].equals("+")){
int num1 = stack.pop();
int num2 = stack.pop();
stack.push(num1 + num2);
}else if(tokens[i].equals("-")){
int num1 = stack.pop();
int num2 = stack.pop();
stack.push(num2 - num1);
}else if(tokens[i].equals("*")){
int num1 = stack.pop();
int num2 = stack.pop();
stack.push(num1 * num2);
}else if(tokens[i].equals( "/")){
int num1 = stack.pop();
int num2 = stack.pop();
stack.push(num2 / num1);
}else{
stack.push(Integer.parseInt(tokens[i]));
}
}
return stack.pop();
}
}
在jdk1.8之后可以使用switch 来判断string类型。