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 함수를 포함하는 스택
추천
출처blog.csdn.net/qq_32862515/article/details/109217942
추천
행