import time
query_lst = [-60000,-6000,-600,-60,-6,0,6,60,600,6000,60000]
lst = []
dic = {}
for i in range(1000000):
lst.append(i)
dic[i] = 1
start = time.time()
for v in query_lst:
if v in lst:
continue
end1 = time.time()
for v in query_lst:
if v in dic:
continue
end2 = time.time()
print "list search time : %f"%(end1-start)
print "dict search time : %f"%(end2-end1)
运行结果:
list search time : 0.117689
dict search time : 0.000000
通过上例我们可以看到list的查找效率远远低于dict的效率,原因如下:
python中list对象的存储结构采用的是线性表,因此其查询复杂度为O(n),而dict对象的存储结构采用的是散列表(hash表),其在最优情况下查询复杂度为O(1)。
参考链接:
https://blog.csdn.net/wzgbm/article/details/54691615