优先级队列的java堆实现?
我试图使用堆实现一个病人队列(根比子代小),但当我打印队列时,病人队列看起来没有优先顺序
插入方法可以很好地工作,但它是enqueue
方法,它不会对项目进行优先级排序
// Heap class
.....some code
//insertion: inserts patients into minimum heap using an array.
//expand array as needed and reorder heap to maintain its properties
public void insert(ER_Patient patient) {
if(heapArray.length==count)
expand();
heapArray[count] = patient;
count++;
if(count>1)
reorder();
}
// Priority Queue class
.......some code
public void enqueue(ER_Patient patient) {
try {
heap.insert(patient);
} catch (NoSuchCategoryException exception) {
System.out.println("Can't enqueue");
}
}
// copy content of original's array to a new larger array
private void expand(){
ER_Patient[] tempArray = new ER_Patient[heapArray.length * 8];
for(int i=0;i<=heapArray.length-1;i++)
tempArray[i]=heapArray[i];
heapArray = tempArray;
}
// maintain heap property by keeping roots smaller than children
private void reorder(){
ER_Patient temp;
int next = count -1;
temp = heapArray[next];
while((next!=0) && temp.compareTo(heapArray[(next-1)/2])<0){
heapArray[next] = heapArray[(next-1)/2];
next = (next-1)/2;
}
heapArray[next] = temp;
}
# 1 楼答案
重新排序方法的最后一行不应该是while循环的一部分吗
此外,应该有适当的dequeue()方法