实际上刚拿到这个题目时,无从下手,不知道他到底想干啥,好像是需要自己手动设计栈。但是看到官解,瞬间自闭了。比较简单没啥要记录的。
class MinStack {
public:
/** initialize your data structure here. */
stack<int> data;
stack<int> min_data;
MinStack() {
min_data.push(INT_MAX);
}
void push(int x) {
data.push(x);
min_data.push(min(min_data.top(),x));
}
void pop() {
data.pop();
min_data.pop();
}
int top() {
return data.top();
}
int getMin() {
return min_data.top();
}
};
/**
* 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();
*/