LeetCode原题链接:逆波兰表达式的求值
题目描述:
根据逆波兰表示法,求表达式的值。
有效的运算符包括 +, -, , / 。每个运算对象可以是整数,也可以是另一个逆波兰表达式。
说明:
整数除法只保留整数部分。
给定逆波兰表达式总是有效的。换句话说,表达式总会得出有效数值且不存在除数为 0 的情况。
示例 1:
输入: [“2”, “1”, “+”, “3”, ""]
输出: 9
解释: ((2 + 1) * 3) = 9
示例 2:
输入: [“4”, “13”, “5”, “/”, “+”]
输出: 6
解释: (4 + (13 / 5)) = 6
代码实现:
import java.util.Stack;
public class Stack_practice {
public static void main(String[] args) {
test4();//150. 逆波兰表达式求值
}
private static void test4() {
Solution solution = new Solution();
String [] a = new String[]{"2", "1", "+", "3", "*"};
String [] b = new String[]{"4", "13", "5", "/", "+"};
String [] c = new String[]{"10", "6", "9", "3", "+", "-11", "*", "/", "*", "17", "+", "5", "+"};
System.out.println(solution.evalRPN(a));
System.out.println("----------------------------------");
System.out.println(solution.evalRPN(b));
System.out.println("----------------------------------");
System.out.println(solution.evalRPN(c));
}
}
class Solution {
public int evalRPN(String[] tokens) {
Stack<Integer> stack = new Stack<>();
int top,top1;
for(String a : tokens) {
switch (a){
case "+":
top = stack.pop();
top1 = stack.pop();
stack.push(top1 + top);
break;
case "-":
top = stack.pop();
top1 = stack.pop();
stack.push(top1 - top);
break;
case "*":
top = stack.pop();
top1 = stack.pop();
stack.push(top1 * top);
break;
case "/":
top = stack.pop();
top1 = stack.pop();
stack.push(top1 / top );
break;
default:
stack.push(Integer.valueOf(a));
break;
}
}
return stack.peek();
}
}