[size=small]
Deque接口定义了QUEUE(First-In-First-Out)的功能，同时也定义了Stack(Last-In-First-Out)的功能。
java.util.Deque<E>
A linear collection that supports element insertion and removal at both ends. The name deque is short for "double ended queue" and is usually pronounced "deck".
LinkedList实现了Deque,所以
当需要Queue的功能时，直接使用LinkedList即可。
当需要Stack的功能时，直接使用LinkedList即可。
具体请参见Deque接口的Jdk文档描述,注意不是LinkedList的文档。
java.util.LinkedList<E>
Doubly-linked list implementation of the List and Deque interfaces. Implements all optional list operations, and permits all elements (including null).
[/size]
Deque接口定义了QUEUE(First-In-First-Out)的功能，同时也定义了Stack(Last-In-First-Out)的功能。
java.util.Deque<E>
A linear collection that supports element insertion and removal at both ends. The name deque is short for "double ended queue" and is usually pronounced "deck".
LinkedList实现了Deque,所以
当需要Queue的功能时，直接使用LinkedList即可。
当需要Stack的功能时，直接使用LinkedList即可。
具体请参见Deque接口的Jdk文档描述,注意不是LinkedList的文档。
java.util.LinkedList<E>
Doubly-linked list implementation of the List and Deque interfaces. Implements all optional list operations, and permits all elements (including null).
[/size]
扫一扫
888
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
