对于较小的示例，元素的多样性有限，您可以使用集合和字典理解：
>>> mylist = [1,1,1,1,1,1,2,3,2,2,2,2,3,3,4,5,5,5,5]
>>> {k:mylist.count(k) for k in set(mylist)}
{1: 6, 2: 5, 3: 3, 4: 1, 5: 4}
为了打破它，set(mylist)使列表唯一并使其更加紧凑：
>>> set(mylist)
set([1, 2, 3, 4, 5])
然后字典理解逐步遍历唯一值并设置列表中的计数。
这也是显著地比使用 Counter 更快，比使用 setdefault 更快：
from __future__ import print_function
from collections import Counter
from collections import defaultdict
import random
mylist=[1,1,1,1,1,1,2,3,2,2,2,2,3,3,4,5,5,5,5]*10
def s1(mylist):
return {k:mylist.count(k) for k in set(mylist)}
def s2(mlist):
return Counter(mylist)
def s3(mylist):
mydict=dict()
for index in mylist:
mydict[index] = mydict.setdefault(index, 0) + 1
return mydict
def s4(mylist):
mydict={}.fromkeys(mylist,0)
for k in mydict:
mydict[k]=mylist.count(k)
return mydict
def s5(mylist):
mydict={}
for k in mylist:
mydict[k]=mydict.get(k,0)+1
return mydict
def s6(mylist):
mydict=defaultdict(int)
for i in mylist:
mydict[i] += 1
return mydict
def s7(mylist):
mydict={}.fromkeys(mylist,0)
for e in mylist:
mydict[e]+=1
return mydict
if __name__ == '__main__':
import timeit
n=1000000
print(timeit.timeit("s1(mylist)", setup="from __main__ import s1, mylist",number=n))
print(timeit.timeit("s2(mylist)", setup="from __main__ import s2, mylist, Counter",number=n))
print(timeit.timeit("s3(mylist)", setup="from __main__ import s3, mylist",number=n))
print(timeit.timeit("s4(mylist)", setup="from __main__ import s4, mylist",number=n))
print(timeit.timeit("s5(mylist)", setup="from __main__ import s5, mylist",number=n))
print(timeit.timeit("s6(mylist)", setup="from __main__ import s6, mylist, defaultdict",number=n))
print(timeit.timeit("s7(mylist)", setup="from __main__ import s7, mylist",number=n))
在我的机器上打印（Python 3）：
18.123854104997008 # set and dict comprehension
78.54796334600542 # Counter
33.98185228800867 # setdefault
19.0563529439969 # fromkeys / count
34.54294775899325 # dict.get
21.134678319009254 # defaultdict
22.760544238000875 # fromkeys / loop
对于较大的列表，例如 1000 万个整数，具有更多不同的元素（1,500 个随机整数），请在循环中使用 defaultdict 或 fromkeys：
from __future__ import print_function
from collections import Counter
from collections import defaultdict
import random
mylist = [random.randint(0,1500) for _ in range(10000000)]
def s1(mylist):
return {k:mylist.count(k) for k in set(mylist)}
def s2(mlist):
return Counter(mylist)
def s3(mylist):
mydict=dict()
for index in mylist:
mydict[index] = mydict.setdefault(index, 0) + 1
return mydict
def s4(mylist):
mydict={}.fromkeys(mylist,0)
for k in mydict:
mydict[k]=mylist.count(k)
return mydict
def s5(mylist):
mydict={}
for k in mylist:
mydict[k]=mydict.get(k,0)+1
return mydict
def s6(mylist):
mydict=defaultdict(int)
for i in mylist:
mydict[i] += 1
return mydict
def s7(mylist):
mydict={}.fromkeys(mylist,0)
for e in mylist:
mydict[e]+=1
return mydict
if __name__ == '__main__':
import timeit
n=1
print(timeit.timeit("s1(mylist)", setup="from __main__ import s1, mylist",number=n))
print(timeit.timeit("s2(mylist)", setup="from __main__ import s2, mylist, Counter",number=n))
print(timeit.timeit("s3(mylist)", setup="from __main__ import s3, mylist",number=n))
print(timeit.timeit("s4(mylist)", setup="from __main__ import s4, mylist",number=n))
print(timeit.timeit("s5(mylist)", setup="from __main__ import s5, mylist",number=n))
print(timeit.timeit("s6(mylist)", setup="from __main__ import s6, mylist, defaultdict",number=n))
print(timeit.timeit("s7(mylist)", setup="from __main__ import s7, mylist",number=n))
Prints:
2825.2697427899984 # set and dict comprehension
42.607481333994656 # Counter
22.77713537499949 # setdefault
2853.11187016801 # fromkeys / count
23.241977066005347 # dict.get
15.023175164998975 # defaultdict
18.28165417900891 # fromkeys / loop
您可以看到依赖于的解决方案count与其他解决方案相比，在大列表中进行适度次数的操作将遭受严重/灾难性的影响。
