-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcalculate.cpp
65 lines (56 loc) · 1.91 KB
/
calculate.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
class Solution {
private:
int getPrecedence(char op) {
if(op == '*' || op == '/')
return 1;
return 0;
}
int performOperation(char op, int op1, int op2) {
switch(op) {
case '*':
return op1 * op2;
case '/':
return op1 / op2;
case '+':
return op1 + op2;
case '-':
return op1 - op2;
default:
return 0;
}
}
public:
int calculate(string s) {
stack<int> operandStack;
stack<char> operatorStack;
int n = s.size();
for(int i = 0; i < n; ++i) {
if(isdigit(s[i])) {
int num = 0;
while(i < n && isdigit(s[i])) {
num *= 10;
num += s[i] - '0';
i++;
}
i--;
operandStack.push(num);
} else if(s[i] != ' ') {
int chPrecedence = getPrecedence(s[i]);
while(!operatorStack.empty() && chPrecedence <= getPrecedence(operatorStack.top())) {
char op = operatorStack.top(); operatorStack.pop();
int op2 = operandStack.top(); operandStack.pop();
int op1 = operandStack.top(); operandStack.pop();
operandStack.push(performOperation(op, op1, op2));
}
operatorStack.push(s[i]);
}
}
while(!operatorStack.empty()) {
char op = operatorStack.top(); operatorStack.pop();
int op2 = operandStack.top(); operandStack.pop();
int op1 = operandStack.top(); operandStack.pop();
operandStack.push(performOperation(op, op1, op2));
}
return operandStack.top();
}
};