优先级队列的实现

Author: sclcoder

src/com/ds_algo/k_heap/TestMain.java renamed to src/com/ds_algo/k_heap/TestHeapMain.java

@@ -0,0 +1,29 @@
+package com.ds_algo.m_priorityQueue;
+
+import java.util.Comparator;
+
+public class Person implements Comparable<Person> {
+    int age;
+    String name;
+    int brokenBone;
+
+    public Person(int age, String name, int brokenBone) {
+        this.age = age;
+        this.name = name;
+        this.brokenBone = brokenBone;
+    }
+
+    @Override
+    public int compareTo(Person o) {
+        return this.brokenBone - o.brokenBone;
+    }
+
+    @Override
+    public String toString() {
+        return "Person{" +
+                "age=" + age +
+                ", name='" + name + '\'' +
+                ", brokenBone=" + brokenBone +
+                '}';
+    }
+}

src/com/ds_algo/m_priorityQueue/Person.java

@@ -1,4 +1,48 @@
 package com.ds_algo.m_priorityQueue;
 
-public class PriorityQueue {
+import com.ds_algo.k_heap.BinaryHeap;
+
+import java.util.Comparator;
+
+/**
+ * 优先级队列
+ * 普通队列 :FIFO原则，先进先出
+ * 优先级队列 :按照优先级的高低进行 出队列, 比如将高优先级的元素最为队头
+ *
+ * 实现的数据结构 : 二叉堆
+ */
+
+public class PriorityQueue<E> {
+    private BinaryHeap<E> heap;
+
+    public PriorityQueue(Comparator<E> comparator){
+        this.heap = new BinaryHeap<E>(comparator);
+    }
+    public PriorityQueue() {
+        this(null);
+    }
+
+    public int size(){
+        return heap.size();
+    }
+
+    public boolean isEmpty(){
+        return heap.isEmpty();
+    }
+    public void clear(){
+        heap.clear();
+    }
+
+    public void enQueue(E element){
+        heap.add(element);
+    }
+
+    public E deQueue(){
+        return heap.remove();
+    }
+
+    public E front(){
+       return heap.get();
+    }
+
 }

src/com/ds_algo/m_priorityQueue/PriorityQueue.java

@@ -0,0 +1,20 @@
+package com.ds_algo.m_priorityQueue;
+
+
+public class TestPriorityQueueMain {
+
+    public static void main(String[] args) {
+
+        PriorityQueue<Person> queue = new PriorityQueue<>();
+        queue.enQueue(new Person(10,"Jack", 1));
+        queue.enQueue(new Person(10,"Luce", 5));
+        queue.enQueue(new Person(10,"Rose", 2));
+        queue.enQueue(new Person(10,"Kobe", 10));
+        queue.enQueue(new Person(10,"Tomas", 2));
+        queue.enQueue(new Person(10,"James", 11));
+
+        while (!queue.isEmpty()){
+            System.out.println(queue.deQueue());
+        }
+    }
+}