标签：
3.2 How would you design a stack which, in addition to push and pop, also has a function min which returns the minimum element? Push, pop and min should all operate in O(1) time.
LeetCode上的原题，请参见我之前的博客Min Stack 最小栈。
标签：
原文地址：http://www.cnblogs.com/grandyang/p/4675699.html
