-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeetCode_155_Min_Stack.java
More file actions
55 lines (50 loc) · 1.07 KB
/
Copy pathLeetCode_155_Min_Stack.java
File metadata and controls
55 lines (50 loc) · 1.07 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
55
class MinStack {
Stack<Long> st=new Stack<Long>();
Long mini;
public MinStack() {
mini=Long.MAX_VALUE;
}
public void push(int val) {
Long value=Long.valueOf(val);
if(st.isEmpty()){
mini=value;
st.push(value);
}
else{
if(value<mini){
st.push(2*value-mini);
mini=value;
}
else{
st.push(value);
}
}
}
public void pop() {
if(st.isEmpty()){
return;
}
Long val=st.pop();
if(val<mini){
mini=2*mini-val;
}
}
public int top() {
Long val=st.peek();
if(val<mini){
return mini.intValue();
}
return val.intValue();
}
public int getMin() {
return mini.intValue();
}
}
/**
* Your MinStack object will be instantiated and called as such:
* MinStack obj = new MinStack();
* obj.push(val);
* obj.pop();
* int param_3 = obj.top();
* int param_4 = obj.getMin();
*/