-
Notifications
You must be signed in to change notification settings - Fork 30
/
Copy pathEvaluate Reverse Polish Notation.cpp
53 lines (41 loc) · 1.62 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
/*
Solution by Rahul Surana
***********************************************************
You are given an array of strings tokens that represents an arithmetic expression in a Reverse Polish Notation.
Evaluate the expression. Return an integer that represents the value of the expression.
Note that:
The valid operators are '+', '-', '*', and '/'.
Each operand may be an integer or another expression.
The division between two integers always truncates toward zero.
There will not be any division by zero.
The input represents a valid arithmetic expression in a reverse polish notation.
The answer and all the intermediate calculations can be represented in a 32-bit integer.
***********************************************************
*/
class Solution {
public:
int evalRPN(vector<string>& tokens) {
stack<int> s;
for(auto x: tokens){
int d = 0;
if(x.length() ==1 && (x[0] == '+' || x[0] == '-' || x[0] == '*' ||x[0] == '/')) {
int a = s.top();
s.pop();
int b = s.top();
s.pop();
// cout << b <<" "<< x <<" "<<a <<"\n";
if(x == "+") { s.push(a+b); }
else if(x == "/"){ s.push(b/a); }
else if(x == "*"){ s.push(a*b); }
else if(x == "-"){ s.push(b-a); }
}
else{
int d = 0;
bool neg = false;
for(auto z: x) { if(z >= '0' && z <= '9') { d*=10; d +=z-'0'; } else neg = true; }
s.push( (neg? -1 : 1) * d);
}
}
return s.top();
}
};