首页 > 其他 > 详细

Min Stack

时间:2015-04-12 13:15:25      阅读:117      评论:0      收藏:0      [点我收藏+]

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

  • push(x) -- Push element x onto stack.
  • pop() -- Removes the element on top of the stack.
  • top() -- Get the top element.
  • getMin() -- Retrieve the minimum element in the stack.
 1 class MinStack {
 2 public:
 3     void push(int x) {
 4         if(sta.size() == 0){
 5             sta.push(x);
 6             min.push(x);
 7         }
 8         else{
 9             if(x <= min.top()) min.push(x);
10             sta.push(x);
11         }
12     }
13 
14     void pop() {
15         if(min.top() == sta.top()){
16             sta.pop();
17             min.pop();
18         }
19         else sta.pop();
20     }
21 
22     int top() {
23         return sta.top();
24     }
25 
26     int getMin() {
27         return min.top();
28     }
29 private:
30     stack<int> sta;
31     stack<int> min;
32 };

Min Stack

原文:http://www.cnblogs.com/amazingzoe/p/4419358.html

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