-
Notifications
You must be signed in to change notification settings - Fork 121
/
Copy pathEvaluateReversePolishNotation.java
52 lines (46 loc) · 1.08 KB
/
EvaluateReversePolishNotation.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
/**
* Evaluate the value of an arithmetic expression in Reverse Polish Notation.
*
* Valid operators are +, -, *, /. Each operand may be an integer or another expression.
*
* Some examples:
* ["2", "1", "+", "3", "*"] -> ((2 + 1) * 3) -> 9
* ["4", "13", "5", "/", "+"] -> (4 + (13 / 5)) -> 6
*/
import java.util.Stack;
public class EvaluateReversePolishNotation {
public int evalRPN(String[] tokens) {
Stack<Integer> st = new Stack<Integer>();
int size = tokens.length;
for (int i = 0; i < size; i++) {
if (isDigital(tokens[i])) {
st.push(Integer.parseInt(tokens[i]));
} else {
st.push(calc(st.pop(), st.pop(), tokens[i]));
}
}
return st.pop();
}
private Integer calc(Integer num2, Integer num1, String op) {
switch (op.charAt(0)) {
case '+':
return num1 + num2;
case '-':
return num1 - num2;
case '*':
return num1 * num2;
case '/':
return num1 / num2;
default:
return 0;
}
}
private boolean isDigital(String s) {
try {
Integer.parseInt(s);
} catch (NumberFormatException e) {
return false;
}
return true;
}
}