class MinStack {
public:
stack<int> st;
multiset<int> s;
MinStack() {
}
void push(int val) {
st.push(val);
s.insert(val);
}
void pop() {
int val=st.top();
st.pop();
s.erase(s.find(val));
}
int top() {
return st.top();
}
int getMin() {
return *(s.begin());
}
};
/**
* 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();
*/
Leetcode155. 最小栈
发布时间 2023-07-05 10:42:28作者: 穿过雾的阴霾