class Solution { public: stack<int> stack1,stack2; void push(int value) { stack1.push(value); if(stack2.empty()) stack2.push(value); else if(value<=stack2.top()) { stack2.push(value); } } void pop() { if(stack1.top()==stack2.top()) stack2.pop(); stack1.pop(); } int top() { return stack1.top(); } int min() { return stack2.top(); } };
原文:https://www.cnblogs.com/cstdio1/p/11237051.html