-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmin-stack.java
More file actions
42 lines (35 loc) · 847 Bytes
/
Copy pathmin-stack.java
File metadata and controls
42 lines (35 loc) · 847 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
public class MinStack {
int[] arr = new int[10000];
int nowIndex = -1;
/** initialize your data structure here. */
public MinStack() {
}
public void push(int x) {
arr[++nowIndex] = x;
}
public void pop() {
if (nowIndex >= 0) {
arr[nowIndex] = 0;
nowIndex--;
}
}
public int top() {
return arr[nowIndex];
}
public int getMin() {
int temp = Integer.MAX_VALUE;
for (int i = 0; i <= nowIndex; i++) {
if (temp >= arr[i])
temp = arr[i];
}
return temp;
}
}
/**
* 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();
*/