Evaluate Reverse Polish Notation (Java)

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

注意：此题输入是string[]，所以注意处理方式，只能判断equals和符号的关系，如果判断数字呢?

逆波兰式有输入数字和符号的顺序关系，不能全部遍历push后再集体pop处理，必须根据符号判断一边压栈一边出栈

注意x1和x2的pop顺序

Source

public class Solution {
     public int evalRPN(String[] tokens) {
    	if(tokens.length == 0) return 0;
    	Stack<Integer> num = new Stack<Integer>();
    
    	for(int i = 0; i < tokens.length; i++){
    		int total = 0;
    		if(tokens[i].equals("+") || tokens[i].equals("-") || tokens[i].equals("*") || tokens[i].equals("/")){
    			int x2 = num.pop(), x1 = num.pop();		//***
    			if(tokens[i].equals("+"))
    				total = x1 + x2;
    			else if(tokens[i].equals("-"))
    				total = x1 - x2;
    			else if(tokens[i].equals("*"))
    				total = x1 * x2;
    			else if(tokens[i].equals("/"))
    				total = x1 / x2;
    			num.push(total);	//***
    		}
    		else num.push(Integer.valueOf(tokens[i]));
    	}

        return num.pop();
    	
    }
}

Test

    public static void main(String[] args){
    	String[] tokens = {"0", "3", "/"};
     	int b = new Solution().evalRPN(tokens);
     	System.out.println(b);
     	
    }