-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathBasicCalculatorII.java
62 lines (55 loc) · 1.52 KB
/
BasicCalculatorII.java
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
package com.smlnskgmail.jaman.leetcodejava.medium;
import java.util.Stack;
// https://leetcode.com/problems/basic-calculator-ii/
public class BasicCalculatorII {
private final String input;
public BasicCalculatorII(String s) {
this.input = s;
}
public int solution() {
Stack<Integer> stack = new Stack<>();
int curr = 0;
char op = '+';
for (int i = 0; i < input.length(); i++) {
char c = input.charAt(i);
if (Character.isDigit(c)) {
curr = curr * 10 + c - '0';
} else if (c != ' ') {
stack.push(
performOperation(
stack,
op,
curr
)
);
curr = 0;
op = c;
}
}
stack.push(
performOperation(
stack,
op,
curr
)
);
int result = 0;
for (int num : stack) {
result += num;
}
return result;
}
private int performOperation(Stack<Integer> stack, char op, int num) {
switch (op) {
case '+':
return num;
case '-':
return -num;
case '*':
return stack.pop() * num;
case '/':
return stack.pop() / num;
}
return -1;
}
}