码迷,mamicode.com
首页 > 其他好文 > 详细

leetcode Min Stack

时间:2014-11-16 13:30:08      阅读:174      评论:0      收藏:0      [点我收藏+]

标签:des   style   color   ar   sp   java   div   on   代码   

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

标签:des   style   color   ar   sp   java   div   on   代码   

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

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!