合并两个双端队列的最快方法 [英] Fastest way to merge two deques

问题描述

是否存在一种更快的合并两个双端队列的方法?

Exist a faster way to merge two deques than this?

# a, b are two deques. The maximum length 
# of a is greater than the current length 
# of a plus the current length of b

while len(b):
  a.append(b.popleft())

请注意，我对保留输入双端队列不感兴趣，只对尽快合并合并双端感兴趣.

Note that I'm not interested in preserving input deques, I'm only interested in having the merged one as fast as possible.

推荐答案

不需要逐元素追加，只需使用+=:

There's no need for elementwise appending, you can just use +=:

from collections import deque

a = deque([1, 2, 3])
b = deque([4, 5, 6])

a += b

print(a)

deque([1, 2, 3, 4, 5, 6])

这篇关于合并两个双端队列的最快方法的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！