-
Notifications
You must be signed in to change notification settings - Fork 522
/
Copy path24. Basic Calculator II.cpp
68 lines (61 loc) · 1.41 KB
/
24. Basic Calculator II.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
/*
Basic Calculator II
===================
Given a string s which represents an expression, evaluate this expression and return its value.
The integer division should truncate toward zero.
Example 1:
Input: s = "3+2*2"
Output: 7
Example 2:
Input: s = " 3/2 "
Output: 1
Example 3:
Input: s = " 3+5 / 2 "
Output: 5
Constraints:
1 <= s.length <= 3 * 105
s consists of integers and operators ('+', '-', '*', '/') separated by some number of spaces.
s represents a valid expression.
All the integers in the expression are non-negative integers in the range [0, 231 - 1].
The answer is guaranteed to fit in a 32-bit integer.
*/
class Solution
{
public:
int calculate(string s)
{
stack<int> myStack;
char sign = '+';
long long res = 0, tmp = 0;
for (int i = 0; i < s.size(); i++)
{
if (isdigit(s[i]))
tmp = 10 * tmp + s[i] - '0';
if (!isdigit(s[i]) && !isspace(s[i]) || i == s.size() - 1)
{
if (sign == '-')
myStack.push(-tmp);
else if (sign == '+')
myStack.push(tmp);
else
{
int num;
if (sign == '*')
num = myStack.top() * tmp;
else
num = myStack.top() / tmp;
myStack.pop();
myStack.push(num);
}
sign = s[i];
tmp = 0;
}
}
while (!myStack.empty())
{
res += myStack.top();
myStack.pop();
}
return res;
}
};