用java实现有序链表额机制

public class Link {
	
	public int data;
	
	public Link next;
	
	public Link(int data){
		this.data=data;
	}
	
	public void print(){
		System.out.println("链结点的数据值是:"+data);
	}
	
	

}

public class SortLinkList {
	
	public Link first = null;
	
	/**
	 * 有序插入链结点*/
	public void insert(int data){
		
		Link privious = null;
		Link current;
		current = first;
		
		Link newlink = new Link(data);//创建要插入的链结点
		
		while (current!=null && data > current.data) {
			
			privious = current;//保存当前结点的引用
			current = current.next;
			
		}
		
		if (privious == null) {
			
			first = newlink;
			
		}else {
			
			privious.next = newlink;
		}
		
		newlink.next = current;
		
	}
	
	/**
	 *删除链结点*/
	public Link del(){
		
		Link temp = first;
		first = first.next;
		
		return temp;
		
	}
	
	/**
	 * 显  示*/
	public void display(){
		
		Link current = first;
		
		while (current != null) {
			
			current.print();//打印
			current = current.next;
			
		}
		
	}
}

<pre name="code" class="html">/**
 * 用java实现
 * 
 *    有许链表的工作机制**/

public class Main {
	
	public static void main(String[] args) {
		
		SortLinkList sortLinkList = new SortLinkList();
		
		sortLinkList.insert(1);
		sortLinkList.insert(9);
		sortLinkList.insert(6);
		sortLinkList.insert(4);
		sortLinkList.insert(100);
		
		sortLinkList.display();//显示
	    System.out.println("----------------------");
		sortLinkList.del();
		sortLinkList.display();
		
	}
	
	/*链结点的数据值是:1
	链结点的数据值是:4
	链结点的数据值是:6
	链结点的数据值是:9
	链结点的数据值是:100
	----------------------
	链结点的数据值是:4
	链结点的数据值是:6
	链结点的数据值是:9
	链结点的数据值是:100*/

}