本文共 750 字，大约阅读时间需要 2 分钟。
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
class MinStack {public: void push(int x) { elements.push(x); if (mins.empty()||x<=mins.top()) mins.push(x); } void pop() { if (elements.empty()) return; if (elements.top() == mins.top()) mins.pop(); elements.pop(); } int top() { return elements.top(); } int getMin() { return mins.top(); } private: stack elements; stack mins;}; 转载地址：http://hyxti.baihongyu.com/