-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMin_Stack.java
66 lines (61 loc) · 1.15 KB
/
Min_Stack.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
class MinStack {
Stack<Long> s= new Stack<>();
Long m;
public MinStack() {
m=Long.MAX_VALUE;
}
public void push(int value) {
Long val=Long.valueOf(value);
if(s.isEmpty())
{
m=val;
s.push(val);
}
else
{
if (val < m)
{
s.push(2*val - m);
m = val;
}
else
{
s.push(val);
}
}
}
public void pop() {
if (s.isEmpty())
{
return;
}
Long v=s.peek();
if (v<m)
{
m=(2*m-v);
}
s.pop();
}
public int top() {
Long v=s.peek();
if (v<m)
{
return m.intValue();
}
else
{
return v.intValue();
}
}
public int getMin() {
return m.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();
*/