Repository navigation
Expand file tree
/
Copy path0155. Min Stack.java
More file actions
88 lines (72 loc) · 1.71 KB
/
Copy path0155. Min Stack.java
File metadata and controls
88 lines (72 loc) · 1.71 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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
// class MinStack {
// private Stack<Integer> s;
// private Stack<Integer> min;
// public MinStack() {
// s = new Stack<>();
// min = new Stack<>();
// }
// public void push(int val) {
// s.push(val);
// if (min.isEmpty() || val <= min.peek()) {
// min.push(val);
// }
// }
// public void pop() {
// if (s.isEmpty()) return;
// int top = s.pop();
// if (top == min.peek()) {
// min.pop();
// }
// }
// public int top() {
// return s.peek();
// }
// public int getMin() {
// return min.peek();
// }
// }
// /**
// * 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();
// */
class MinStack {
private Node head;
public void push(int x) {
if (head == null) {
head = new Node(x, x, null);
} else {
head = new Node(x, Math.min(x, head.min), head);
}
}
public void pop() {
head = head.next;
}
public int top() {
return head.val;
}
public int getMin() {
return head.min;
}
private class Node {
int val;
int min;
Node next;
private Node(int val, int min, Node next) {
this.val = val;
this.min = min;
this.next = next;
}
}
}
/**
* 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();
*/