[CareerCup] 3.2 Min Stack 最小栈

 

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 最小栈

 

posted @ 2015-07-25 12:55  Grandyang  阅读(686)  评论(0编辑  收藏  举报
Fork me on GitHub