forked from rachitiitr/DataStructures-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path155.min-stack.cpp
More file actions
39 lines (34 loc) · 727 Bytes
/
155.min-stack.cpp
File metadata and controls
39 lines (34 loc) · 727 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
class MinStack {
public:
/** initialize your data structure here. */
vector<int> a, b;
MinStack() {
a = b = {};
}
void push(int x) {
a.push_back(x);
if(b.empty()) b.push_back(x);
else {
int newMin = min(x, *b.rbegin());
b.push_back(newMin);
}
}
void pop() {
a.pop_back();
b.pop_back();
}
int top() {
return *a.rbegin();
}
int getMin() {
return *b.rbegin();
}
};
/**
* 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();
*/