class MinStack {
public:
/** initialize your data structure here. */
stack<int> x_stack;
stack<int> min_stack;
MinStack() {
min_stack.push(INT_MAX);
}
void push(int x) {
x_stack.push(x);
min_stack.push(x < min_stack.top()?x:min_stack.top());
}
void pop() {
x_stack.pop();
min_stack.pop();
}
int top() {
return x_stack.top();
}
int min() {
return min_stack.top();
}
};
LeetCode剑指 Offer 30. 包含min函数的栈
最新推荐文章于 2023-02-18 18:05:53 发布