Skip to main content

PriorityQueue

extends AbstractQueue implements java.io.Serializable

优先级队列，通过最小堆实现

  • 容器实体
transient Object[] queue; // non-private to simplify nested class access

扩容​

 // Double size if small; else grow by 50%
int newCapacity = oldCapacity + ((oldCapacity < 64) ? (oldCapacity + 2) : (oldCapacity >> 1));

基本用法​

import java.util.PriorityQueue;

public class Main {
    public static void main(String[] args) {
        PriorityQueue<Integer> pq = new PriorityQueue<>();

        pq.add(3);
        pq.add(1);
        pq.add(4);
        pq.add(2);

        System.out.println(pq.peek());  // Outputs: 1
        System.out.println(pq.poll());  // Outputs: 1
        System.out.println(pq.peek());  // Outputs: 2
    }
}