代码随想录算法训练营第十天
150. 逆波兰表达式求值
思路还是比较简单的,数据类型需要注意。
class Solution {
public:
int evalRPN(vector<string>& tokens) {
stack<long long> st;
for(int i = 0; i < tokens.size(); i++) {
if (tokens[i] == "+" || tokens[i] == "-" || tokens[i] == "*" || tokens[i] == "/") {
long long num1 = st.top();
st.pop();
long long num2 = st.top();
st.pop();
if(tokens[i] == "+") {
st.push(num1 + num2);
}
else if(tokens[i] == "-") {
st.push(num2 - num1);
}
else if(tokens[i] == "*") {
st.push(num2 * num1);
}
else if(tokens[i] == "/") {
st.push(num2 / num1);
}
}
else {
st.push(stoll(tokens[i]));
}
}
int result = st.top();
st.pop();
return result;
}
};