#算法与数据结构
###算法的基础内容
###测算不同算法加入列表元素的快慢
#!usr/bin/env python
# -*- coding:utf-8 _*-
"""
@author: think
@file: 01time.py
@time: 2020/09/20
@desc:
"""
from timeit import Timer
def t1():
li=[]
for i in range(100):
li.append(i)
def t2():
li=[]
for i in range(100):
li+=[i]
def t3():
li=[i for i in range(100)]
def t4():
li=list(range(100))
def t5():
li=[]
for i in range(100):
li.extend([i])
timer1=Timer("t1()","from __main__ import t1")#main是作为启动文件的名字用来调用t1(),
print("append:",timer1.timeit(100))
timer2=Timer("t2()","from __main__ import t2")
print("+:",timer2.timeit(100))
timer3=Timer("t3()","from __main__ import t3")
print("makeList:",timer3.timeit(100))
timer4=Timer("t4()","from __main__ import t4")
print("list:",timer4.timeit(100))
timer5=Timer("t5()","from __main__ import t5")
print("extend:",timer5.timeit(100))
###数据结构
根据不同的数据结构选择不同的方法