Leetcode - vector\stack - 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

使用类似栈的结构，top指向栈顶元素，若top等于表示栈的数组的大小-1，则扩展数组。在判断输入的string是否是+-*/时，注意不能使用(*i)[0]——无法处理负数。

class Solution {
public:
    int evalRPN(vector<string> &tokens) {
        vector<int> ivec;
        int top=-1;
        for(auto i=tokens.begin();i!=tokens.end();i++)
        {
            if(*i!="+"&&*i!="-"&&*i!="*"&&*i!="/")
            {
                if(top++==ivec.size()-1)
                    ivec.push_back(stoi(*i));
                else
                    ivec[top]=stoi(*i);
            }
            else
            {
                switch ((*i)[0])
                {
                    case '+':ivec[top-1]=ivec[top-1]+ivec[top];break;
                    case '-':ivec[top-1]=ivec[top-1]-ivec[top];break;
                    case '*':ivec[top-1]=ivec[top-1]*ivec[top];break;
                    case '/':ivec[top-1]=ivec[top-1]/ivec[top];break;
                    default :break;
                }
                top--;
            }
        }
        return ivec[0];
    }
};

/**
 * 1.tokens is empty.
 * 2.tokens lack of valid operators
 * 3.negative operand
 */
class Solution {
public:
    int evalRPN(vector<string> &tokens) {
        if(tokens.empty())
            return 0;
        stack<int> numbers;
        for(auto i=tokens.begin();i<tokens.end();i++)
        {
            if((*i)!="+"&&(*i)!="-"&&(*i)!="*"&&(*i)!="/") // '+''-''*''/' is ok only when operator is +.
                numbers.push(stoi(*i));
            else
            {
                char c=(*i)[0];
                int operand2=numbers.top();
                numbers.pop();
                int operand1=numbers.top();
                numbers.pop();
                switch(c)
                {
                    case '+':numbers.push(operand1+operand2);break;
                    case '-':numbers.push(operand1-operand2);break;
                    case '*':numbers.push(operand1*operand2);break;
                    case '/':numbers.push(operand1/operand2);break;
                }
            }
        }
        if(numbers.size()==1)
            return numbers.top();
        else
            throw runtime_error("too many operands in tokens");
    }
};