最快的解决方案是使用切片分配
>>> ListA = [None, None, None, None, None]
>>> ListB = ['A', None, 'B']
>>> ListA[:len(ListB)] = ListB
>>> ListA
['A', None, 'B', None, None]
定时
>>> def merge_AO(ListA, ListB):
return [ i[1] for i in map(None,ListA,ListB)]
>>> def merge_ke(ListA, ListB):
for x in range(len(ListB)): #till end of b
ListA[x]=ListB[x]
return ListA
>>> def merge_JK(ListA, ListB):
ListA = [b or a for a, b in izip_longest(ListA,ListB)]
return ListA
>>> def merge_AB(ListA, ListB):
ListA[:len(ListB)] = ListB
return ListA
>>> funcs = ["merge_{}".format(e) for e in ["AO","ke","JK","AB"]]
>>> _setup = "from __main__ import izip_longest, ListA, ListB, {}"
>>> tit = [(timeit.Timer(stmt=f + "(ListA, ListB)", setup = _setup.format(f)), f) for f in funcs]
>>> for t, foo in tit:
"{} took {} secs".format(t.timeit(100000), foo)
'0.259869612113 took merge_AO secs'
'0.115819095634 took merge_ke secs'
'0.204675467452 took merge_JK secs'
'0.0318886645255 took merge_AB secs'