它实际上并不是一个骗子,因为您想过滤以仅计算某个集合中的字符,您可以使用 Counter dict 进行计数并使用一组允许的字符进行过滤:
word = ["h", "e", "l", "l", "o"]
from collections import Counter
from string import ascii_lowercase
# create a set of the characters you want to count.
allowed = set(ascii_lowercase + 'ñ')
# use a Counter dict to get the counts, only counting chars that are in the allowed set.
counts = Counter(s for s in word if s in allowed)
如果你真的只想要总和:
total = sum(s in allowed for s in word)
或者使用函数式方法:
total = sum(1 for _ in filter(allowed.__contains__, word))
对于任何方法,使用 filter 都会更快一些:
In [31]: from collections import Counter
...: from string import ascii_lowercase, digits
...: from random import choice
...:
In [32]: chars = [choice(digits+ascii_lowercase+'ñ') for _ in range(100000)]
In [33]: timeit Counter(s for s in chars if s in allowed)
100 loops, best of 3: 36.8 ms per loop
In [34]: timeit Counter(filter(allowed.__contains__, chars))
10 loops, best of 3: 31.7 ms per loop
In [35]: timeit sum(s in allowed for s in chars)
10 loops, best of 3: 35.4 ms per loop
In [36]: timeit sum(1 for _ in filter(allowed.__contains__, chars))
100 loops, best of 3: 32 ms per loop
如果您想要不区分大小写的匹配,请使用 ascii_letters 并添加 'ñÑ':
from string import ascii_letters
allowed = set(ascii_letters+ 'ñÑ')