-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMinStack.java
More file actions
52 lines (44 loc) · 951 Bytes
/
Copy pathMinStack.java
File metadata and controls
52 lines (44 loc) · 951 Bytes
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
package stack;
import java.util.Deque;
import java.util.LinkedList;
public class MinStack {
Deque<Integer> dataStack;
Deque<Integer> minStack;
/**
* 初始化堆栈对象。
*/
public MinStack() {
dataStack = new LinkedList<>();
minStack = new LinkedList<>();
minStack.push(Integer.MAX_VALUE);
}
/**
* 将元素val推入堆栈。
* @param val
*/
public void push(int val) {
dataStack.push(val);
minStack.push(Math.min(val, minStack.peek()));
}
/**
* 删除堆栈顶部的元素。
*/
public void pop() {
dataStack.pop();
minStack.pop();
}
/**
* 获取堆栈顶部的元素。
* @return
*/
public int top() {
return dataStack.peek();
}
/**
* 获取堆栈中的最小元素。
* @return
*/
public int getMin() {
return minStack.peek();
}
}