优先级队列

优先级队列是有排序的

类

public class PriorityQ {private long[] queArray;private int maxSize;private int nItems;public PriorityQ(int s){maxSize=s;queArray=new long[maxSize];nItems=0;}public void insert(long item){int i;if(nItems==0){queArray[nItems++]=item;}else{for(i=nItems-1;i>-1;i--){if(item>queArray[i])queArray[i+1]=queArray[i];else {break;}}queArray[i+1]=item;nItems++;}}public long remove(){return queArray[--nItems];}public long peekMin(){return queArray[nItems-1];}public boolean isEmpty(){return nItems==0;}public boolean isFull(){return nItems==maxSize;}}

主程序

public class PriorityQApp {public static void main(String[] args){PriorityQ thePQ=new PriorityQ(5);thePQ.insert(30);thePQ.insert(50);thePQ.insert(10);thePQ.insert(40);thePQ.insert(20);while(!thePQ.isEmpty()){long item=thePQ.remove();System.out.print(item+" ");}}}