forked from DmrfCoder/AlgorithmAndDataStructure
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
59 lines (45 loc) · 1.55 KB
/
Solution.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
package two;
import java.util.Stack;
/**
* @author dmrfcoder
* @date 2019/4/10
*/
public class Solution {
public int evalRPN(String[] tokens) {
Stack<Integer> operateStack = new Stack<>();
int size = tokens.length;
for (int index = 0; index < size; index += 1) {
String itemToken = tokens[index];
if ("+".equals(itemToken) || "-".equals(itemToken) || "*".equals(itemToken) || "/".equals(itemToken)) {
Integer operate2 = operateStack.pop();
Integer operate1 = operateStack.pop();
Integer result = 0;
switch (itemToken) {
case "+":
result = operate1 + operate2;
break;
case "-":
result = operate1 - operate2;
break;
case "*":
result = operate1 * operate2;
break;
case "/":
result = (Integer) operate1 / operate2;
break;
default:
break;
}
operateStack.push(result);
} else {
operateStack.push(Integer.valueOf(itemToken));
}
}
return operateStack.pop();
}
public static void main(String[] args) {
String[] token = {"2","1","+","3","*"};
Solution solution = new Solution();
System.out.println(solution.evalRPN(token));
}
}