Java中LinkedList/Queue/Deque/Stack/PriorityQueue总结

1.LinkedList

https://www.cnblogs.com/jbclown/p/16024181.html
https://blog.csdn.net/qq_45058331/article/details/123112600

LinkedList<Integer> list = new LinkedList<>();

2.Queue

https://www.runoob.com/java/data-queue.html

Queue<Integer> queue = new LinkedList<>();

3.Deque

https://www.cnblogs.com/dw3306/p/17361898.html

Deque<Integer> deque = new LinkedList<>();

4.Stack

https://blog.csdn.net/qq_45058331/article/details/123112600

Stack<Integer> stack = new Stack<>();

5.PriorityQueue

https://blog.csdn.net/weixin_73616913/article/details/131361059
默认PriorityQueue队列是小根堆，如果需要大堆需要用户提供比较器。

PriorityQueue<Integer> q1 = new PriorityQueue<>();