150. Evaluate Reverse Polish Notation(逆波兰表达式求值)

题目链接：https://leetcode.com/problems/evaluate-reverse-polish-notation/

Evaluate the value of an arithmetic expression in Reverse Polish Notation.

Valid operators are +, -, *, /. Each operand may be an integer or another expression.

Note:

• Division between two integers should truncate toward zero.
• The given RPN expression is always valid. That means the expression would always evaluate to a result and there won't be any divide by zero operation.

Example 1:

Input: ["2", "1", "+", "3", "*"]
Output: 9
Explanation: ((2 + 1) * 3) = 9

Example 2:

Input: ["4", "13", "5", "/", "+"]
Output: 6
Explanation: (4 + (13 / 5)) = 6

Example 3:

Input: ["10", "6", "9", "3", "+", "-11", "*", "/", "*", "17", "+", "5", "+"]
Output: 22
Explanation: 
  ((10 * (6 / ((9 + 3) * -11))) + 17) + 5
= ((10 * (6 / (12 * -11))) + 17) + 5
= ((10 * (6 / -132)) + 17) + 5
= ((10 * 0) + 17) + 5
= (0 + 17) + 5
= 17 + 5
= 22

思路：

用栈来存放数字即可。

AC 5ms 92.5% Java：

class Solution {
    public int evalRPN(String[] tokens) {
        Stack<Integer> sk=new Stack();
        for(int i=0;i<tokens.length;i++){
            String s=tokens[i];
            switch (s){
                case "+":
                    sk.push(sk.pop()+sk.pop());
                    break;
                case "*":
                    sk.push(sk.pop()*sk.pop());
                    break;
                case "-":
                    int temp1=sk.pop();
                    sk.push(sk.pop()-temp1);
                    break;
                case "/":
                    int temp2=sk.pop();
                    sk.push(sk.pop()/temp2);
                    break;
                default:
                    sk.push(Integer.parseInt(s));
            }
        }
        return sk.pop();
    }
}