-
Notifications
You must be signed in to change notification settings - Fork 0
/
155-MinStack.java
53 lines (43 loc) · 1.12 KB
/
155-MinStack.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
// 155 - Min Stack
class MinStack {
/** initialize your data structure here. */
Stack<StackPair> stack;
public MinStack() {
stack = new Stack<>();
}
public void push(int x) {
if (stack.isEmpty()) {
stack.push(new StackPair(x, x));
} else {
int currMinInStack = stack.peek().currMin;
stack.push(new StackPair(x, Math.min(x, currMinInStack)));
}
}
public void pop() {
if(!stack.isEmpty()) {
stack.pop();
}
}
public int top() {
return stack.peek().val;
}
public int getMin() {
return stack.peek().currMin;
}
class StackPair {
int val;
int currMin;
StackPair(int val, int currMin) {
this.val = -1;
this.currMin = currMin;
}
}
}
/**
* Your MinStack object will be instantiated and called as such:
* MinStack obj = new MinStack();
* obj.push(x);
* obj.pop();
* int param_3 = obj.top();
* int param_4 = obj.getMin();
*/