class MinStack {
public:
MinStack() {
}
void push(int x) {
stack.push(x);
if (min_stack.empty() || min_stack.top() >= x) {
min_stack.push(x);
}
}
void pop() {
if (!stack.empty()) {
if (stack.top() == min_stack.top()) {
min_stack.pop();
}
stack.pop();
}
}
int top() {
return stack.top();
}
int min() {
return min_stack.top();
}
private:
stack<int> stack, min_stack;
};
剑指 Offer 30. 包含min函数的栈 LCOF
猜你喜欢
转载自blog.csdn.net/jcl314159/article/details/119573012
今日推荐
周排行