-
Notifications
You must be signed in to change notification settings - Fork 0
/
Evaluate Reverse Polish Notation.cpp
75 lines (74 loc) · 1.35 KB
/
Evaluate Reverse Polish Notation.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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
#include<iostream>
#include<string>
#include<vector>
#include <cctype>
#include<algorithm>
#include<math.h>
#include<stack>
using namespace std ;
typedef struct ListNode{
int val;
ListNode * next;
} ListNode;
class Solution {
public:
int evalRPN(vector<string>& tokens) {
int res;
int i,j,temp1,temp2;
int size=tokens.size();
stack<int> nums;
if(tokens.empty())
return 0;
for(i=0;i<size;i++){
if(tokens[i]=="+"){
temp1=nums.top();
nums.pop();
temp2=nums.top();
nums.pop();
nums.push(temp1+temp2);
}
else if(tokens[i]=="-"){
temp1=nums.top();
nums.pop();
temp2=nums.top();
nums.pop();
nums.push(temp2-temp1);
}
else if(tokens[i]=="*"){
temp1=nums.top();
nums.pop();
temp2=nums.top();
nums.pop();
nums.push(temp1*temp2);
}
else if(tokens[i]=="/"){
temp1=nums.top();
nums.pop();
temp2=nums.top();
nums.pop();
nums.push(temp2/temp1);
}
else
nums.push(atoi(tokens[i].c_str()));
}
return nums.top();
}
void print()
{
vector<string> A;
A.push_back("4");
A.push_back("13");
A.push_back("5");
A.push_back("/");
A.push_back("+");
cout<<evalRPN(A)<<endl;
}
};
int main()
{
Solution test;
// cout<<test.Low("A man, a plan, a canal: Panama")<<endl;
test.print();
// cout<<atoi("2147483648")<<endl;
system("pause");
}