【数据结构】手写小顶堆（实现泛型和简单扩容）

最新推荐文章于 2023-06-15 22:34:12 发布

阿霖

最新推荐文章于 2023-06-15 22:34:12 发布

阅读量155

点赞数

本文链接：https://blog.csdn.net/qq_43673818/article/details/119798348

版权

小顶堆

/**
 * @Author yl
 * 小顶堆
 */
public class MyHeap<T> {
   

    private int size = 0;

    private T[] queue;

    private Comparator<T> comparator;

    public MyHeap(Integer size, Comparator<T> comparator) {
   
        queue = (T[]) new Object[size];
        this.comparator = comparator;
    }

    public void offer(T val) throws Exception {
   
        if (size >= queue.length) {
   
            grow();
        }
        if (size == 0) {
   
            queue[0] = val;
            size++;
            return;
        }
        queue[size] = val;
        sifUp(size, val);
        size++;
    }

    private void grow() {
   
        int newSize = size * 2;
        queue = Arrays.copyOf(queue, newSize);
    }

    public T poll() {
   
        if (size == 0) {
   
            return null;
        }
        T result = q