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

题目：逆波兰式求值

思路：设置一个数字栈，遍历tokens，如果是不为'+'、‘-’、‘*’、‘/’四个操作符，则说明是数字，那么入栈，如果是操作符，取出栈顶两个元素进行运算，并将运算结果入栈。最后结果就是栈顶元素。需要注意的是，如果不为操作符，需要判断数字是否是负数，还未要将string转为int的数字。

代码：

class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        stack<int> stack;
        for(auto item :tokens){
        	if(item == string("+")||item == string("-")||item == string("*")||item==string("/")){//是符号，取出栈顶两个元素进行操作
        		int b = stack.top();
        		stack.pop();
        		int a = stack.top();
        		stack.pop();
        		if(item[0] == '+')
       				stack.push(a+b);
        		else if(item[0] == '-')		
					stack.push(a-b);
				else if(item[0] == '*')
					stack.push(a*b);
				else if(item[0] == '/')
					stack.push(a/b);
			}
			else{
				int val = StringToInt(item);//数字进栈
				stack.push(val);
			}
		}
		return stack.top();
    }
    int StringToInt(string S){//将string转为int
		int ret=0;
		int flag=1;
		for(int i=0;i<S.size();i++){
			if(S[i]=='-')
				flag = -1;
			else
				ret = ret*10+S[i]-'0';	
		}
		return ret*flag;	 
	}
};

AC beats 100%