LeetCode155. 最小栈

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(min(min_stack.top(), x)); } void pop() { x_stack.pop(); min_stack.pop(); } int top() { return x_stack.top(); } int getMin() { return min_stack.top(); } };