155.最小栈

155.最小栈

题目分析

• 如何能实现O(1)的返回最小值：
  维护一个存放最小值的栈minStack，每次push时，就比较栈顶，把较小的再push到最小栈中，这样stack中每一个元素都对应着以它为栈顶时的一个最小值

Solution - minStack

public class MinStack {
	/* 用来存放正常数据 */
	private Stack<Integer> stack;
	/* 用来存放最小数据 */
	private Stack<Integer> minStack;

	public MinStack() {
		stack = new Stack<>();
		minStack = new Stack<>();
	}
   
	public void push(int x) {
		stack.push(x);
		if (minStack.isEmpty()) {
			minStack.push(x);
		} else {
			minStack.push(Math.min(x, minStack.peek()));
		}
	}
   
	public void pop() {
		stack.pop();
		minStack.pop();
	}
   
	public int top() {
		return stack.peek();
	}
   
	public int getMin() {
		return minStack.peek();
	}
}

Solution - LinkedList

• 其实和最小栈大同小异，只是每次把最小值绑定在一起

private Node head;

	public MinStack() {
		head = new Node(0, Integer.MAX_VALUE, null);
	}
	
	public void push(int x) {
		head = new Node(x, Math.min(x, 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 {
		public int val;
		public int min;
		public Node next;
		public Node(int val, int min, Node next) {
			this.val = val;
			this.min = min;
			this.next = next;
		}
	}

Reference：小码哥MJ