LeetCode 150. 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

• 解题思路
  从左到右遍历表达式的每个数字和字符，遇到数字就进栈，遇到符号，就将栈顶的两个数字取出（注意第一次取出的是右操作数，第二次取出的栈顶数字是左操作数），进行运算，将运算结果压栈，一直到最终获得计算结果（最终的栈顶数字）。

• 代码

class Solution {
    public int evalRPN(String[] tokens) {
        int a,b;
		Stack<Integer> S = new Stack<Integer>();
		for (String s : tokens) {
			if(s.equals("+")) {
				S.push(S.pop()+S.pop());
			}
			else if(s.equals("/")) {
				b = S.pop();
				a = S.pop();
				S.push(a / b);
			}
			else if(s.equals("*")) {
				S.push(S.pop() * S.pop());
			}
			else if(s.equals("-")) {
				b = S.pop();
				a = S.pop();
				S.push(a - b);
			}
			else {
				S.push(Integer.parseInt(s));
			}
		}	
		return S.pop();
    }
}