首页 > 其他 > 详细

leetcode Min Stack

时间:2014-11-16 13:27:31      阅读:497      评论: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.


利用Java现有类Stack建立两个Stack 类
一个用来模拟正常的堆栈,
一个用来存储最小的值。

代码如下:

class MinStack {
    private Stack <Integer> stack = new Stack<Integer>();
    private Stack <Integer> minStack = new Stack<Integer>();
    
    public void push(int x) {
        if(minStack.isEmpty()||x<=minStack.peek())
            minStack.push(x);
        stack.push(x);
    }

    public void pop() {
        if(stack.peek().equals(minStack.peek()))
            minStack.pop();
        stack.pop();
    }

    public int top() {
        return stack.peek();
    }

    public int getMin() {
        return minStack.peek();
    }
    
}


leetcode Min Stack

原文:http://blog.csdn.net/zhuangjingyang/article/details/41171433

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