1.知识储备:
2.编码实现:
package PriorityQueue;
public class minPriorityQueue<T extends Comparable<T>> {
//存储数据
private T[] items;
//记录元素个数
private int N;
public minPriorityQueue(int capacity) {
// TODO Auto-generated constructor stub
this.items=(T[])new Comparable[capacity+1];
}
//判断索引i处的元素是否小于索引j处的元素
public boolean less(int i,int j){
return items[i]