优先队列PriorityQueue实例

优先队列，迭代按随机顺序访问元素；删除操作则总是删除剩余元素中最小（优先级最高）的元素。

package 集合;
//优先队列
import java.time.LocalDate;
import java.util.PriorityQueue;

public class PriorityQueueTest {
    public static void main(String[] args) {
        var pq = new PriorityQueue<LocalDate>();
        pq.add(LocalDate.of(1999, 3, 14));
        pq.add(LocalDate.of(2003,2,1));
        pq.add(LocalDate.of(1997, 10, 21));

        System.out.println("遍历元素");
        for(LocalDate date : pq){
            System.out.println(date);
        }

        System.out.println("Removing elements....");
        while (! pq.isEmpty()){
            System.out.println(pq.poll());
        }
    }
}