采用大顶堆实现一个优先队列

src/main/java/com/ximo/datastructuresinaction/queue/PriorityQueue.java

@@ -0,0 +1,42 @@
+package com.ximo.datastructuresinaction.queue;
+
+import com.ximo.datastructuresinaction.heap.MaxHeap;
+
+/**
+ * @author xikl
+ * @date 2019/1/5
+ */
+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 void enqueue(E element) {
+        maxHeap.add(element);
+    }
+
+    @Override
+    public E dequeue() {
+        return maxHeap.extractMax();
+    }
+
+    @Override
+    public E getFront() {
+        return maxHeap.findMax();
+    }
+}

src/test/java/com/ximo/datastructuresinaction/queue/QueueTest.java

@@ -4,10 +4,9 @@
 
 import java.time.Duration;
 import java.time.Instant;
+import java.util.PriorityQueue;
 import java.util.Random;
 
-import static org.junit.Assert.*;
-
 /**
  * @author Ximo
  * @date 2018/10/23 22:19
@@ -65,4 +64,10 @@ private static long timeConsuming(Queue<Integer> queue, int count) {
         Duration timeConsuming = Duration.between(start, end);
         return timeConsuming.toMillis() / 1000;
     }
+
+
+    @Test
+    public void testPriorityQueue() {
+        java.util.Queue<Integer> integerQueue = new PriorityQueue<>();
+    }
 }