简体繁体 English

ArrayDeque: addLast(E) + removeLast() 和 push(E) / pop() 一样吗？更喜欢 addFirst(E) + removeFirst() 有什么好处吗？

[英]ArrayDeque: addLast(E) + removeLast() would be same as push(E) / pop()? Does preferring addFirst(E) + removeFirst() have any advantages?

原文 2019-12-28 20:10:57 4 1 java/ collections/ stack/ arraydeque

ArrayDeque docs state that push(E) is same as addFirst(E) , and pop() is same as removeFirst() . ArrayDeque 文档指出push(E)与addFirst(E)相同， pop()与removeFirst()相同。

I think the same effect could be achieved with addLast(E) + removeLast() pair of methods.我认为使用addLast(E) + removeLast()对方法可以实现相同的效果。

Is that right ?是对的吗？
Does preferring addFirst(E) + removeFirst() have any advantages?更喜欢addFirst(E) + removeFirst()有什么好处吗？

1 个解决方案

The methods are summarised in the Deque interface.这些方法总结在Deque接口中。 If you are using the ArrayDeque as a Queue use that interface, otherwise use the Deque methods.如果您将ArrayDeque用作Queue使用该接口，否则使用Deque方法。 I's kind of unfortunate that Deque extends Queue as it is a Queue equally in four different obvious ways.我有点不幸的是， Deque扩展了Queue因为它以四种不同的明显方式同样是一个Queue 。

addFirst（e）和removeFirst（）方法的时间复杂度是多少 - What is the time complexity of the addFirst(e) and the removeFirst() methods

删除链表中的最后一个节点<e> - RemoveLast node in linkedlist <e>

采集 <E> 和集 <E> 是相同的？ - Collection<E> and Set<E> are the same?

为什么+ e取消了-e不？ - Why does +e canceled and -e not?

为什么我们在Deque中提供（E e）和offer（E e）方法，即使它们解决了相同的目的 - why do we have offer(E e) and offerLast(E e) methods in Deque, even though they solve the same purpose

在Java类型参数中，确实如此 <? extends E> 仅指严格的亚型？还是E也足够了？ - In Java type arguments, does <? extends E> mean strictly subtypes only? or would E also suffice?

ArrayDeque类的addFirst方法 - addFirst method of ArrayDeque Class

为什么 LinkedHashSet<E> 扩展哈希集<e>并实现 Set<E> - Why does LinkedHashSet<E> extend HashSet<e> and implement Set<E>

Deque JAVA中的removeLast / addFirst方法 - removeLast / addFirst methods in Deque JAVA

为什么收藏 <E> #toArray（）不返回E []？ - Why does Collection<E>#toArray() not return E[]?

暂无

暂无

声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

相关问题 addFirst（e）和removeFirst（）方法的时间复杂度是多少 - What is the time complexity of the addFirst(e) and the removeFirst() methods 删除链表中的最后一个节点<e> - RemoveLast node in linkedlist <e> 采集 <E> 和集 <E> 是相同的？ - Collection<E> and Set<E> are the same? 为什么+ e取消了-e不？ - Why does +e canceled and -e not? 为什么我们在Deque中提供（E e）和offer（E e）方法，即使它们解决了相同的目的 - why do we have offer(E e) and offerLast(E e) methods in Deque, even though they solve the same purpose 在Java类型参数中，确实如此 <? extends E> 仅指严格的亚型？还是E也足够了？ - In Java type arguments, does <? extends E> mean strictly subtypes only? or would E also suffice? ArrayDeque类的addFirst方法 - addFirst method of ArrayDeque Class 为什么 LinkedHashSet<E> 扩展哈希集<e>并实现 Set<E> - Why does LinkedHashSet<E> extend HashSet<e> and implement Set<E> Deque JAVA中的removeLast / addFirst方法 - removeLast / addFirst methods in Deque JAVA 为什么收藏 <E> #toArray（）不返回E []？ - Why does Collection<E>#toArray() not return E[]?

相关标签

粤ICP备18138465号 © 2020-2024 STACKOOM.COM