前言
Java的PriorityQueue学习笔记
继承结构
graph TD
Object --> AbstractCollection
AbstractCollection --> AbstractQueue
AbstractQueue --> PriorityQueue
Iterable --> Collection
Collection --> Queue
Queue --> AbstractQueue
style Object fill:#f0f8ff,stroke:#696969
style AbstractCollection fill:#f0f8ff,stroke:#696969
style AbstractQueue fill:#f0f8ff,stroke:#696969
style PriorityQueue fill:#f0f8ff,stroke:#696969
style Iterable fill:#f0f8ff,stroke:#4169e1
style Collection fill:#f0f8ff,stroke:#4169e1
style Queue fill:#f0f8ff,stroke:#4169e1
创建对象
1
| PriorityQueue<Object> priorityQueue = new PriorityQueue<>();
|
指定排序规则
1 2 3
| PriorityQueue<Object> priorityQueue = new PriorityQueue<>((Object o1, Object o2) -> { return o1.compareTo(o2); });
|
Queue的相关方法
传送门
完成