forked from varunu28/LeetCode-Java-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBaseball Game.java
More file actions
54 lines (53 loc) · 1.54 KB
/
Baseball Game.java
File metadata and controls
54 lines (53 loc) · 1.54 KB
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
class Solution {
public int calPoints(String[] ops) {
int prev = Integer.MIN_VALUE;
int prevprev = Integer.MIN_VALUE;
Stack<Integer> st = new Stack<>();
int s = 0;
int j = 0;
for (int i=0;i<ops.length;i++) {
if (ops[i].equals("D")) {
st.push(prev*2);
s += prev*2;
j++;
prevprev = prev;
prev = st.peek();
}
else if (ops[i].equals("C")) {
j--;
int t = st.pop();
s -= t;
if (j == 1) {
prevprev = Integer.MIN_VALUE;
prev = st.peek();
}
else if (j == 0) {
prevprev = Integer.MIN_VALUE;
prev = Integer.MIN_VALUE;
}
else {
prev = st.peek();
int k1 = st.pop();
prevprev = st.pop();
st.push(prevprev);
st.push(k1);
}
}
else if (ops[i].equals("+")) {
st.push(prev + prevprev);
s += st.peek();
j++;
prevprev = prev;
prev = st.peek();
}
else {
st.push(Integer.parseInt(ops[i]));
j++;
prevprev = prev;
prev = st.peek();
s += st.peek();
}
}
return s;
}
}