dequeue和list的效率比对

test.py

import time, collections

start = time.perf_counter()

a = []
for i in range(10000000):
    a.insert(0, 0);a.pop(0)
print(time.perf_counter() - start)

start = time.perf_counter()
a = collections.deque([])
for i in range(10000000):
    a.insert(0, 0);a.pop()
print(time.perf_counter() - start)




start = time.perf_counter()
a = []
for i in range(10000000):
    a += [0]
print(time.perf_counter() - start)

start = time.perf_counter()
a = []
for i in range(10000000):
    a.append(0)
print(time.perf_counter() - start)

start = time.perf_counter()
a = collections.deque([])
for i in range(10000000):
    a.append(0)
print(time.perf_counter() - start)

"""
Output:
5.4079986
2.2909950000000006
1.7664375999999988
1.3421816
1.332309200000001
"""