Repository navigation
Expand file tree
/
Copy path_155MinStack.java
More file actions
69 lines (62 loc) · 1.72 KB
/
Copy path_155MinStack.java
File metadata and controls
69 lines (62 loc) · 1.72 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
import java.util.Stack;
/**
* Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
* <p>
* push(x) -- Push element x onto stack.
* pop() -- Removes the element on top of the stack.
* top() -- Get the top element.
* getMin() -- Retrieve the minimum element in the stack.
* <p>
* Example:
* MinStack minStack = new MinStack();
* minStack.push(-2);
* minStack.push(0);
* minStack.push(-3);
* minStack.getMin(); --> Returns -3.
* minStack.pop();
* minStack.top(); --> Returns 0.
* minStack.getMin(); --> Returns -2.
* <p>
* Created by drfish on 6/8/2017.
*/
public class _155MinStack {
public class MinStack {
Stack<Integer> stack;
Stack<Integer> minStack;
/**
* initialize your data structure here.
*/
public MinStack() {
stack = new Stack<>();
minStack = new Stack<>();
}
public void push(int x) {
stack.push(x);
if (minStack.isEmpty() || minStack.peek() >= x) {
minStack.push(x);
}
}
public void pop() {
int x = stack.pop();
if (x == minStack.peek()) {
minStack.pop();
}
}
public int top() {
return stack.peek();
}
public int getMin() {
return minStack.peek();
}
}
public static void main(String[] args) {
MinStack minStack = new _155MinStack().new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
assert -3 == minStack.getMin();
minStack.pop();
assert 0 == minStack.top();
assert -2 == minStack.getMin();
}
}