leetcode 155.最小栈

private class Node {
       private int val;
       Node left;
       Node right;
       
       private Node(int val) {
       	this.val = val;
       }
}

private Node head = new Node(0);
private Node min = new Node(0);
   public MinStack() {
   	
   }
   
   public void push(int x) {
   	// 主栈入操作
   	Node N = new Node(x);
   	head.right = N;
   	N.left = head;
   	head = head.right;
   	// 最小栈入操作
   	Node N_min = new Node(x);
   	// 初始化操作
   	if(min.right == null) {
   		min.right = N_min;
   		N_min.left = min;
   		return;
   	}
   	Node point = min;
   	// 寻找插入点
   	while(N_min.val > point.right.val) {
   		point = point.right;
   		if(point.right == null) {
       		break;
       	}
   	}
   	if(point.right == null) {
   		point.right = N_min;
   		N_min.left = point;
   	}else {
   		N_min.left = point;
   		N_min.right = point.right;
   		point.right = N_min;
   		N_min.right.left = N_min;
   	}
   	
   }
   
   public void pop() {
   	Node N = head;
   	// 主栈出操作
   	head = head.left;
   	head.right = null;
   	// 最小栈出操作
   	Node point = min.right;
   	while(N.val != point.val) {
   		point = point.right;
   	}
   	if(point.right == null) {
   		point.left.right = null;
   		point.left = null;
   	}else {
   		point.left.right = point.right;
   		point.right.left = point.left;
   		point.left = null;
   		point.right = null;
   	}
   }
   
   public int top() {
   	return head.val;
   }
   
   public int getMin() {
   	return this.min.right.val;
   }