-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
155.java
90 lines (76 loc) · 1.97 KB
/
155.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
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
89
90
__________________________________________________________________________________________________
sample 43 ms submission
// how do I know the new min if I pop the current min?
// solution => push the old min when we found a new min, in push()
class MinStack {
int min = Integer.MAX_VALUE;
Stack<Integer> stack;
/** initialize your data structure here. */
public MinStack() {
stack = new Stack<>();
}
public void push(int x) {
if (x <= min) {
stack.push(min);
min = x;
}
stack.push(x);
}
public void pop() {
if (stack.pop() == min) {
min = stack.pop();
}
}
public int top() {
return stack.peek();
}
public int getMin() {
return min;
}
}
/**
* 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();
*/
__________________________________________________________________________________________________
sample 36480 kb submission
public class MinStack {
/**
* initialize your data structure here.
*/
int size;
int[] elements;
int[] min;
public MinStack() {
size = 0;
elements = new int[10000];
min = new int[10000];
}
public void push(int x) {
elements[size] = x;
min[size] = Math.min(x, size == 0 ? Integer.MAX_VALUE : min[size - 1]);
size++;
}
public void pop() {
size--;
}
public int top() {
return elements[size - 1];
}
public int getMin() {
return min[size - 1];
}
}
/**
* 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();
*/
__________________________________________________________________________________________________