双端队列（时间复杂度）
[英]Deque (time complexity)
问题描述
What is the time complexity for accessing deque[0], deque[somewhere in the middle], and deque[-1]?
访问 deque[0]、deque[中间某处] 和 deque[-1] 的时间复杂度是多少？
1 个解决方案
解决方案1
2 2022-08-15 17:57:02
From the documentation :从文档中：
Indexed access is O(1) at both ends but slows to O(n) in the middle.
This suggests that the implementation is a doubly-linked list.这表明该实现是一个双向链表。
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.
相关问题
时间复杂度：删除双端队列的元素 - Time complexity: deleting element of deque
访问collections.deque长度的时间复杂度 - Time complexity of accessing collections.deque length
遍历 Python 中的双端队列的时间复杂度是多少？ - What is the time complexity of iterating through a deque in Python?
检查双端队列为空时的时间复杂度 - Time complexity when checking deque is empty
合并两个“双端队列”的时间复杂度最低的解决方案是什么？ - What's the lowest time complexity solution to merge two "deque"s?
为什么 collections.deque 的 rotate() 方法具有线性时间复杂度？ - Why does the rotate() method of collections.deque have a linear time complexity?
滑动时间 window 与 python 双端队列 - Sliding time window with python deque
“如果不在”时间复杂度 - 'if not in' time complexity
将collections.deque转换为python列表的算法复杂度是多少？ - What is the algorithmic complexity of converting a collections.deque to python list?
时间复杂度与空间复杂度 - Time complexity vs Space complexity
相关标签