-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path150_EvaluateReversePolishNotation150.java
69 lines (65 loc) · 1.97 KB
/
150_EvaluateReversePolishNotation150.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
63
64
65
66
67
68
/**
* Evaluate the value of an arithmetic expression in Reverse Polish Notation.
*
* Valid operators are +, -, *, /. Each operand may be an integer or another expression.
*
* Note:
*
* Division between two integers should truncate toward zero.
* The given RPN expression is always valid. That means the expression would
* always evaluate to a result and there won't be any divide by zero operation.
*
* Example 1:
* Input: ["2", "1", "+", "3", "*"]
* Output: 9
* Explanation: ((2 + 1) * 3) = 9
*
* Example 2:
* Input: ["4", "13", "5", "/", "+"]
* Output: 6
* Explanation: (4 + (13 / 5)) = 6
*
* Example 3:
* Input: ["10", "6", "9", "3", "+", "-11", "*", "/", "*", "17", "+", "5", "+"]
* Output: 22
* Explanation:
* ((10 * (6 / ((9 + 3) * -11))) + 17) + 5
* = ((10 * (6 / (12 * -11))) + 17) + 5
* = ((10 * (6 / -132)) + 17) + 5
* = ((10 * 0) + 17) + 5
* = (0 + 17) + 5
* = 17 + 5
* = 22
*/
public class EvaluateReversePolishNotation150 {
public int evalRPN(String[] tokens) {
Stack<Integer> stack = new Stack<>();
for (String t: tokens) {
switch (t) {
case "+":
Integer i1 = stack.pop();
Integer i2 = stack.pop();
stack.push(i2 + i1);
break;
case "-":
Integer i3 = stack.pop();
Integer i4 = stack.pop();
stack.push(i4 - i3);
break;
case "*":
Integer i5 = stack.pop();
Integer i6 = stack.pop();
stack.push(i6 * i5);
break;
case "/":
Integer i7 = stack.pop();
Integer i8 = stack.pop();
stack.push(i8 / i7);
break;
default:
stack.push(Integer.valueOf(t));
}
}
return stack.pop();
}
}