Leetcode: 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.

Some examples:

  ["2", "1", "+", "3", "*"] -> ((2 + 1) * 3) -> 9
  ["4", "13", "5", "/", "+"] -> (4 + (13 / 5)) -> 6

假设输入都是valid，以下程序没有查错部分。

public class Solution {
	public int evalRPN(String[] tokens) {
		if(tokens.length == 0)
			return 0;
		Stack<Integer> stack = new Stack<Integer>();
		for(int i = 0; i < tokens.length; i++){
			if(isOperator(tokens[i])){
				int cur = calculate(stack.pop(), stack.pop(), tokens[i]);
				stack.push(cur);
			}
			else
				stack.push(Integer.parseInt(tokens[i]));
		}
		return stack.pop();
	}
	
	public boolean isOperator(String op){
		if(op.equals("+") || op.equals("-") || op.equals("*") || op.equals("/") || op.equals("%"))
			return true;
		return false;
	}
	
	public int calculate(int num2, int num1, String op){
		if(op.equals("+"))
			return num1 + num2;
		else if(op.equals("-"))
			return num1 - num2;
		else if(op.equals("*"))
			return num1 * num2;
		else if(op.equals("/"))
			return num1 / num2;
		else if(op.equals("%"))
			return num1 % num2;
		else
			return 0;
	}
}