复杂度分:
基于堆实现优先队列:
package com.lt.datastructure.MaxHeap; import com.lt.datastructure.Queue.Queue; /** * 堆实现优先队列 */ 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(E e) { //查找队首元素 return maxHeap.findMax(); } @Override public void enqueue(E e) { maxHeap.add(e); } @Override public E dequeue() { //最大值先出队 return maxHeap.extractMax(); } }