首页 > 其他 > 详细

[CareerCup] 3.2 Min Stack 最小栈

时间:2015-07-25 13:45:03      阅读:225      评论:0      收藏:0      [点我收藏+]

 

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

 

[CareerCup] 3.2 Min Stack 最小栈

原文:http://www.cnblogs.com/grandyang/p/4675699.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!