链表-j-优先级队列,单向链表实现

package e_link.I_priorityQue;


/**
 * 优先级队列,单向链表实现
 * 
 * @author Administrator
 * 
 */
public class Demo {
public void fun1() {
QueueSort theQs = new QueueSort();
theQs.insert(15);
theQs.insert(25);
theQs.insert(97);
theQs.insert(6);
theQs.insert(7);
theQs.insert(79);
theQs.insert(32);
theQs.insert(66);
theQs.insert(1);
theQs.displayList();
System.out.println();
theQs.remove();
theQs.remove();
theQs.displayList();
}
}package e_link.I_priorityQue;


public class Link {
public int iData;
public Link next;


public Link(int iData) {
this.iData=iData;
}


public void display() {
System.out.print(iData + " ");
}
}package e_link.I_priorityQue;


public class LinkList {
private Link first;


public LinkList() {
first = null;
}


public int deleteMin() {
int temp = first.iData;
first = first.next;
return temp;
}


public void insert(int iData) {
Link newLink = new Link(iData);
Link current = first;
Link previous = null;
// 判断是否为空
while (current != null && current.iData < iData) {// 循环得到存放的位置
previous = current;
current = current.next;
}
if (previous != null)// 说明current在first后面
previous.next = newLink;
else
// 说明current就是first
first = newLink;
newLink.next = current;


}


public boolean isEmpty() {
return first == null;
}


public void displayLink() {
Link current = first;
while (current != null) {
current.display();
current = current.next;
}
}
}package e_link.I_priorityQue;


/**
 * 优先级队列链表实现
 * 
 * @author Administrator
 * 
 */
public class QueueSort {
private LinkList theLinkList;


public QueueSort() {
theLinkList = new LinkList();
}


public void insert(int i) {
theLinkList.insert(i);
}


public int remove() {
int temp = theLinkList.deleteMin();
return temp;
}


public void displayList() {
theLinkList.displayLink();
}
}