【数据结构】PriorityQueue 优先队列

数据结构源码

完成类


public class PriorityQueue<E extends Comparable<E>> implements Queue<E> {
    private MaxHeap<E> maxHeap;
    public PriorityQueue() {
        maxHeap = new MaxHeap<>();
    }
    @Override
    public int getSize() {
        return maxHeap.size();
    }
    @Override
    public boolean isEmpty() {
        return maxHeap.isEmpty();
    }
    @Override
    public E getFront() {
        return maxHeap.findMax();
    }
    @Override
    public void enqueue(E e) {
        maxHeap.add(e);
    }
    @Override
    public E dequeue() {
        return maxHeap.extractMax();
    }
}

数据结构拆解

保护字段和内部类


    private MaxHeap<E> maxHeap;

结构函数


    public PriorityQueue() {
        maxHeap = new MaxHeap<>();
    }


    @Override
    public void enqueue(E e) {
        maxHeap.add(e);
    }


    @Override
    public E dequeue() {
        return maxHeap.extractMax();
    }


    @Override
    public int getSize() {
        return maxHeap.size();
    }
    @Override
    public boolean isEmpty() {
        return maxHeap.isEmpty();
    }
    @Override
    public E getFront() {
        return maxHeap.findMax();
    }