Leetcode150. 逆波兰表达式求值

class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        stack<int> s;
        for(int i = 0; i < tokens.size(); i++){
            if(tokens[i] == "+" || tokens[i] == "-" || tokens[i] == "*" || tokens[i] == "/") {
                int num1 = s.top();
                s.pop();
                int num2 = s.top();
                s.pop();
                if (tokens[i] == "+") s.push(num2 + num1);
                if (tokens[i] == "-") s.push(num2 - num1);
                if (tokens[i] == "*") s.push(num2 * num1);
                if (tokens[i] == "/") s.push(num2 / num1);
            }else{
                s.push(stoi(tokens[i]));
            }
        }
        return s.top();
    }
};

学习到的小语法点：

• stoi 字符串转int