We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 597a9c8 commit 35cd7d7Copy full SHA for 35cd7d7
source/c01/p03_keep_last_n_items.rst
@@ -85,4 +85,4 @@
85
>>> q.popleft()
86
4
87
88
-在队列两端插入或删除元素时间复杂度都是 ``O(1)`` ,而在列表的开头插入或删除元素的时间复杂度为 ``O(N)`` 。
+在队列两端插入或删除元素时间复杂度都是 ``O(1)`` ,区别于列表,在列表的开头插入或删除元素的时间复杂度为 ``O(N)`` 。
0 commit comments