algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 02:53:31 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1668 from axbybgl/axbybgl

Browse Source 
Update 0150.逆波兰表达式求值.md
This commit is contained in:
程序员Carl
2022-10-02 10:47:03 +08:00
committed by GitHub
parent f438788269 b0ec03922e
commit 4a54d705f6
1 changed files with 7 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
problems/0150.逆波兰表达式求值.md
View File

@ -89,26 +89,29 @@ C++代码如下：
class Solution { class Solution {
public: public:
int evalRPN(vector<string>& tokens) { int evalRPN(vector<string>& tokens) {
stack<int> st; // 力扣修改了后台测试数据，需要用longlong
stack<long long> st;
for (int i = 0; i < tokens.size(); i++) { for (int i = 0; i < tokens.size(); i++) {
if (tokens[i] == "+" || tokens[i] == "-" || tokens[i] == "*" || tokens[i] == "/") { if (tokens[i] == "+" || tokens[i] == "-" || tokens[i] == "*" || tokens[i] == "/") {
int num1 = st.top(); long long num1 = st.top();
st.pop(); st.pop();
int num2 = st.top(); long long num2 = st.top();
st.pop(); st.pop();
if (tokens[i] == "+") st.push(num2 + num1); if (tokens[i] == "+") st.push(num2 + num1);
if (tokens[i] == "-") st.push(num2 - num1); if (tokens[i] == "-") st.push(num2 - num1);
if (tokens[i] == "*") st.push((long)num2 * (long)num1); //力扣改了后台测试数据 if (tokens[i] == "*") st.push((long)num2 * (long)num1); //力扣改了后台测试数据
if (tokens[i] == "/") st.push(num2 / num1); if (tokens[i] == "/") st.push(num2 / num1);
} else { } else {
st.push(stoi(tokens[i])); st.push(stoll(tokens[i]));
} }
} }
int result = st.top(); int result = st.top();
st.pop(); // 把栈里最后一个元素弹出（其实不弹出也没事） st.pop(); // 把栈里最后一个元素弹出（其实不弹出也没事）
return result; return result;
} }
}; };
``` ```
## 题外话 ## 题外话