题解 | #包含min函数的栈#
包含min函数的栈
https://www.nowcoder.com/practice/4c776177d2c04c2494f2555c9fcc1e49
class Solution { public: void push(int value) { if (!stack1.size()) { stack1.push(value); stack2.push(value); return; } int min = stack2.top(); if (value <= min) { stack2.push(value); } stack1.push(value); } void pop() { int value = stack1.top(); int min = stack2.top(); if (min == value) { stack2.pop(); } stack1.pop(); } int top() { return stack1.top(); } int min() { return stack2.top(); } private: stack<int> stack1; stack<int> stack2; };