请教下面图片中的这个内容该怎么做呢,我能该如何去解决这种问题呢?
class Solution {
public:
/**
*
* @param tokens string字符串vector
* @return int整型
*/
int evalRPN(vector<string>& tokens) {
stack<int> number;
if(tokens.empty()){
return 0;
}
for(int i=0;i<tokens.size();++i)
{
if(tokens[i]=="+" || tokens[i]=="-" || tokens[i]=="/" || tokens[i]=="*")
{
int a,b,c;
b=number.top();
number.pop();
a=number.top();
number.pop();
if(tokens[i] == "+")
c = a+b;
else if(tokens[i] == "-")
c = a-b;
else if(tokens[i] == "*")
c = a*b;
else
c = a/b;
number.push(c);
}
else
number.push(stoi(tokens[i]));
}
return number.top();
}
};