[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

Analysis:

对于逆波兰式，一般都是用栈来处理，依次处理字符串，

如果是数值，则push到栈里面

如果是操作符，则从栈中pop出来两个元素，计算出值以后，再push到栈里面，

则最后栈里面剩下的元素即为所求。这里提前加了一个0， 为了让leetcode pass

Java

public int evalRPN(String[] tokens) {
        Stack<Integer> operand = new Stack<>();
		operand.push(0);
		for(int i=0;i<tokens.length;i++){
			if((tokens[i].charAt(0)=='-'&& tokens[i].length()>1)||
					(tokens[i].charAt(0)>='0' && tokens[i].charAt(0)<='9')){
				operand.push(Integer.parseInt(tokens[i]));
				continue;
			}
			int op1 = operand.pop();
			int op2 = operand.pop();
			if(tokens[i].equals("+")) operand.push(op2+op1);
			if(tokens[i].equals("-")) operand.push(op2-op1);
			if(tokens[i].equals("*")) operand.push(op2*op1);
			if(tokens[i].equals("/")) operand.push((op1==0)?Integer.MAX_VALUE:op2/op1);
		}
		return operand.peek();
    }

c++

int evalRPN(vector<string> &tokens) {
    string op = "+-*/";// to check the operator
    stack<int> st;
    if(tokens.size()<=0) return 0;
    for(int i=0;i<tokens.size();i++){
        string tok = tokens[i];
        int o = op.find(tok);// operator number
        if(o!=-1){// is an operator
            if(st.size()<2) return -1;
            else{
                int v1 = st.top();
                st.pop();
                int v2 = st.top();
                st.pop();
                if(o==0){st.push(v2+v1);}
                if(o==1){st.push(v2-v1);}
                if(o==2){st.push(v2*v1);}
                if(o==3){st.push(v2/v1);}
            }
        }else{// is a number
            st.push(atoi(tok.c_str()));
        }
    }
    return st.top();
}