-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path16.26+Calculator LCCI.cpp
64 lines (57 loc) · 1.65 KB
/
16.26+Calculator LCCI.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
class Solution {
public:
unordered_map<char, int> ump = {
{'+', 1},
{'-', 1},
{'*', 2},
{'/', 2}
};
stack<int> nums;
stack<char> ops;
void eval() {
int b = nums.top(); nums.pop();
int a = nums.top(); nums.pop();
char op = ops.top(); ops.pop();
int res;
switch (op) {
case '+' : res = a + b; break;
case '-' : res = a - b; break;
case '*' : res = a * b; break;
case '/' : res = a / b; break;
}
nums.push(res);
return;
}
int calculate(string s) {
nums.push(0);
for (int i = 0; i < s.size(); ++i) {
if (s[i] == ' ') continue;
if (isdigit(s[i])) { // NUM
int res = 0;
while (i < s.size() && isdigit(s[i]) ){
res = res * 10 + (s[i++] - '0');
}
i--;
nums.push(res);
} else { //op
if (s[i] == '(') {
ops.push(s[i]);
} else if (s[i] == ')') {
while (ops.top() != '(') {
eval();
}
ops.pop();
} else {
while (!ops.empty() && ops.top() != '(' && ump[ops.top()] >= ump[s[i]]) {
eval();
}
ops.push(s[i]);
}
}
}
while (!ops.empty() && ops.top() != '(') {
eval();
}
return nums.top();
}
};