首页 > 其他 > 详细

155. Min Stack

时间:2015-12-19 17:49:19      阅读:204      评论:0      收藏:0      [点我收藏+]

155. Min Stack

Total Accepted: 54402 Total Submissions: 259750 Difficulty: Easy

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.

 

class MinStack {
public:
    void push(int x) {
        datas.push(x);
        if(!min_elems.empty() && min_elems.top() < x){
            min_elems.push(min_elems.top());
        }else{
            min_elems.push(x);
        }
    }

    void pop() {
        datas.pop();
        min_elems.pop();
    }

    int top() {
        return datas.top();
    }

    int getMin() {
        return min_elems.top();
    }
private:
    stack<int> datas;
    stack<int> min_elems;
};
Next challenges: (H) Sliding Window Maximum

155. Min Stack

原文:http://www.cnblogs.com/zengzy/p/5059377.html

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