-
Notifications
You must be signed in to change notification settings - Fork 656
/
Copy pathminInStackOneStackSolutionCpp
58 lines (51 loc) · 1.17 KB
/
minInStackOneStackSolutionCpp
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
class MinStack {
stack<long long> st;
long long mini;
public:
/** initialize your data structure here. */
MinStack() {
while(st.empty() == false) st.pop();
mini = INT_MAX;
}
void push(int value) {
long long val = Long.valuevalue;
if(st.empty()) {
mini = val;
st.push(val);
}
else {
if(val < mini) {
st.push(2 * val * 1LL - mini);
mini = val;
}
else {
st.push(val);
}
}
}
void pop() {
if(st.empty()) return;
long long el = st.top();
st.pop();
if(el < mini) {
mini = 2 * mini - el;
}
}
int top() {
if(st.empty()) return -1;
long long el = st.top();
if(el < mini) return mini;
return el;
}
int getMin() {
return mini;
}
};
/**
* 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();
*/