-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path224. Basic Calculator.cpp
66 lines (65 loc) · 1.79 KB
/
224. Basic Calculator.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
class Solution {
public:
int calculate1(string s) {
int n = s.size();
function<int(string&,int&)> dfs = [&](string& s, int& pos){
int result=0;
int curr=0;
int sign = 1;
while(pos<n){
char c = s[pos];
if(isdigit(c)){
curr = curr*10 + (c-'0');
}
else if(c=='-' || c=='+'){
result += curr*sign;
sign = (c=='-')? -1:1;
curr=0;
}
else if(c=='(' || c==')'){
result += curr*sign;
if(c=='(' )
curr = dfs(s,++pos);
else{
return result;
}
}
++pos;
}
result += curr*sign;
return result;
};
int pos = 0;
return dfs(s,pos);
}
// stack based
int calculate(string s) {
stack <int> nums, ops;
int num = 0;
int rst = 0;
int sign = 1;
for (char c : s) {
if (isdigit(c)) {
num = num * 10 + ( c - '0');
}
else {
rst += sign * num;
num = 0;
if (c == '+') sign = 1;
if (c == '-') sign = -1;
if (c == '(') {
nums.push(rst);
ops.push(sign);
rst = 0;
sign = 1;
}
if (c == ')' && ops.size()) {
rst = ops.top() * rst + nums.top();
ops.pop(); nums.pop();
}
}
}
rst += sign * num;
return rst;
}
};