Leetcode-155.Min Stack

题目

155. Min Stack

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

Implement the MinStack class:

• MinStack() initializes the stack object.
• void push(int val) pushes the element val onto the stack.
• void pop() removes the element on the top of the stack.
• int top() gets the top element of the stack.
• int getMin() retrieves the minimum element in the stack.

Example 1:

retrieving the minimum element in constant time.
在恒定时间内检索最小元素。

Input
["MinStack","push","push","push","getMin","pop","top","getMin"]
[[],[-2],[0],[-3],[],[],[],[]]

Output
[null,null,null,null,-3,null,0,-2]

Explanation
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); // return -3
minStack.pop();
minStack.top();    // return 0
minStack.getMin(); // return -2

Constraints:

• -2³¹ <= val <= 2³¹ - 1
• Methods pop, top and getMin operations will always be called on non-empty stacks.
• At most 3 * 104 calls will be made to push, pop, top, and getMin.

解法

方法一

辅助栈方法

我们只需要设计一个数据结构，使得每个元素a与其相应的最小值m时刻保持一一对应。因此我们可以使用一个辅助栈，与元素同步插入与删除，用户存储与每个元素对应的最小值。

当一个元素要入栈时，我们取当前辅助栈的栈顶存储的最小值，与当前元素比较得出最小值，将这个最小值插入辅助栈中；

当一个元素要出栈时，我们把辅助栈的栈顶元素也一并弹出；

在任意一个时刻，栈内元素的最小值就存储在辅助栈的栈顶元素中。

class MinStack {
    // 数据栈
    private Stack<Integer> dataStack;

    // 辅助栈
    private Stack<Integer> minStack;

    public MinStack() {
        dataStack = new Stack<Integer>();
        minStack = new Stack<Integer>();
        
    }
    
    public void push(int val) {
        dataStack.push(val);
        if(minStack.isEmpty() || val <= minStack.peek()){
            minStack.push(val);
        }

    }
    
    public void pop() {
        int val = dataStack.pop();
        if( !minStack.isEmpty() && val == minStack.peek()){
            minStack.pop();
        }
    }
    
    public int top() {
        return dataStack.peek();
    }
    
    public int getMin() {
     return   minStack.peek();
    }
}

/**
 * Your MinStack object will be instantiated and called as such:
 * MinStack obj = new MinStack();
 * obj.push(val);
 * obj.pop();
 * int param_3 = obj.top();
 * int param_4 = obj.getMin();
 */

方法二 使用Stack(Node)

栈元素中除了保存当前值之外，额外保存当前最小值。

class MinStack {

    private Stack<Node> minStack;

    public MinStack() {
        minStack = new Stack<Node>();
    }
    
    public void push(int val) {
        if(minStack.isEmpty()){
            minStack.push(new Node(val,val));
        }else{
            minStack.push( new Node(val,Math.min(val,minStack.peek().getMin())));
        }

    }
    
    public void pop() {
        minStack.pop();
    }
    
    public int top() {
        return minStack.peek().getVal();
    }
    
    public int getMin() {
        return minStack.peek().getMin();
    }


    
  private static class Node{

        private int val;
        private int min;

        public Node(int val, int min){
            this.val = val;
            this.min = min;
        }

        public int getVal(){
            return this.val;
        }

        public int getMin(){
            return this.min;
        }
    }
}




/**
 * Your MinStack object will be instantiated and called as such:
 * MinStack obj = new MinStack();
 * obj.push(val);
 * obj.pop();
 * int param_3 = obj.top();
 * int param_4 = obj.getMin();
 */

方法三

自定义栈Stack(),以单链表形式定义栈，链表节点定义如下：

private static class Node{
	int val;
	int min;
	Node Next();

	public Node(int val,int min){
		this(val,min,null);
	}

	public Node(int val,int min, Node next){
		this.val = val;
		this.min = min;
		this.next = next;
	}
}

class MinStack {

    private Node head;

    public MinStack() {
    }
    
    public void push(int val) {
        if(head == null){
            head = new Node(val,val);
        }else{
            head = new Node(val,Math.min(val,head.min),head);
        }
    }
    
    public void pop() {
        head = head.next;
    }
    
    public int top() {
        return head.val;
    }
    
    public int getMin() {
        return head.min;
    }



    private static class Node{
	int val;
	int min;
	Node next;

	public Node(int val,int min){
		this(val,min,null);
	}

	public Node(int val,int min, Node next){
		this.val = val;
		this.min = min;
		this.next = next;
	}
}
}

/**
 * Your MinStack object will be instantiated and called as such:
 * MinStack obj = new MinStack();
 * obj.push(val);
 * obj.pop();
 * int param_3 = obj.top();
 * int param_4 = obj.getMin();
 */

转载

来源：力扣（LeetCode）
链接：https://leetcode.cn/problems/min-stack
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。