-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathEvaluateReversePolishNotation.cpp
48 lines (45 loc) · 1.27 KB
/
EvaluateReversePolishNotation.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int evalRPN(vector<string>& tokens) {
stack<int> st;
for (int i = 0; i < tokens.size(); i++) {
if (tokens[i] == "*") {
int x = st.top();
st.pop();
int y = st.top();
st.pop();
st.push(y * x);
} else if (tokens[i] == "+") {
int x = st.top();
st.pop();
int y = st.top();
st.pop();
st.push(x + y);
} else if (tokens[i] == "-") {
int x = st.top();
st.pop();
int y = st.top();
st.pop();
st.push(y - x);
} else if (tokens[i] == "/") {
int x = st.top();
st.pop();
int y = st.top();
st.pop();
st.push(y / x);
} else {
st.push(stoi(tokens[i]));
}
}
return st.top();
}
};
int main() {
int n;
cin >> n;
vector<string> token(n);
for (int i = 0; i < n; i++) cin >> token[i];
cout << (new Solution())->evalRPN(token) << endl;
}