list or dict
在需要重复查找的时候，dicty用hash表示实现，复杂度为O(1),list的复杂度为O(n) data_list=['a','b','is','python','jason','hello','hill','with','phone','test', 'dfdf','apple','pddf','ind','basic','none','baecr','var','bana','dd','wrd'] data_dict=dict.fromkeys(mlist,True) print(data_dict) {'b': True, 'pddf': True, 'baecr': True, 'ind': True, 'var': True, 'python': True, 'a': True, 'none': True, 'with': True, 'bana': True, 'hill': True, 'is': True, 'wrd': True, 'apple': True, 'dfdf': True, 'dd': True, 'test': True, 'phone': True, 'basic': True, 'hello': True, 'jason': True}

下面对两种进行计时

def gettime(mylist): t=time() #list = dict.fromkeys(list,True) mfilter = [] for i in range (10000): for wd in ['is','hat','new','list','old','.']: if wd not in mylist: mfilter.append(wd) print("total run time:",time()-t) gettime(data_list) total run time: 0.21671438217163086 gettime(dict_list) total run time: 0.044046878814697266