mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-07 15:45:40 +08:00
Update 0150.逆波兰表达式求值.md
力扣修改了后端测试数据
This commit is contained in:
@ -89,10 +89,7 @@ C++代码如下:
|
||||
class Solution {
|
||||
public:
|
||||
int evalRPN(vector<string>& tokens) {
|
||||
// 考虑到第20个样例使用int会溢出
|
||||
// 此处使用long long来存储number
|
||||
// 在最后用int()强行转换成int输出
|
||||
|
||||
// 力扣修改了后台测试数据,需要用longlong
|
||||
stack<long long> st;
|
||||
for (int i = 0; i < tokens.size(); i++) {
|
||||
if (tokens[i] == "+" || tokens[i] == "-" || tokens[i] == "*" || tokens[i] == "/") {
|
||||
@ -105,13 +102,13 @@ public:
|
||||
if (tokens[i] == "*") st.push(num2 * num1);
|
||||
if (tokens[i] == "/") st.push(num2 / num1);
|
||||
} else {
|
||||
st.push(atoll(tokens[i].c_str()));
|
||||
st.push(stoll(tokens[i]));
|
||||
}
|
||||
}
|
||||
|
||||
long long result = st.top();
|
||||
int result = st.top();
|
||||
st.pop(); // 把栈里最后一个元素弹出(其实不弹出也没事)
|
||||
return int(result);
|
||||
return result;
|
||||
}
|
||||
};
|
||||
|
||||
|
Reference in New Issue
Block a user