请改用collections.Counter() class:
from collections import Counter
word_dict = Counter(word)
Counter 做同样的事情;计算word 中每个字母的出现次数。
在您的特定情况下,您没有首先检查密钥是否已经存在,或者如果不存在则提供默认值。你可以使用dict.get() 来做到这一点:
word = 'stacks'
word_dict = {} # to form new dictionary formed from
for letter in word:
word_dict[letter] = word_dict.get(letter, 0) + 1
print word_dict
或单独使用dict.setdefault() 在递增之前显式设置默认值:
word = 'stacks'
word_dict = {} # to form new dictionary formed from
for letter in word:
word_dict.setdefault(letter, 0)
word_dict[letter] += 1
print word_dict
或自己测试密钥:
word = 'stacks'
word_dict = {} # to form new dictionary formed from
for letter in word:
if letter not in word_dict:
word_dict[letter] = 0
word_dict[letter] += 1
print word_dict
按效率降序排列。
或者您可以使用collections.defaultdict() object 自动插入0(如果密钥尚不存在):
from collections import defaultdict
word_dict = defaultdict(int)
for letter in word:
word_dict[letter] += 1
print word_dict
这基本上是 Counter 类所做的,但该类型增加了一些其他细节,例如列出最常用的键或组合计数器。
演示:
>>> from collections import defaultdict, Counter
>>> word = 'stacks'
>>> word_dict = {} # to form new dictionary formed from
>>> for letter in word:
... word_dict[letter] = word_dict.get(letter, 0) + 1
...
>>> word_dict
{'a': 1, 'c': 1, 's': 2, 't': 1, 'k': 1}
>>> word_dict = defaultdict(int)
>>> for letter in word:
... word_dict[letter] += 1
...
>>> word_dict
defaultdict(<type 'int'>, {'a': 1, 'c': 1, 's': 2, 't': 1, 'k': 1})
>>> Counter(word)
Counter({'s': 2, 'a': 1, 'c': 1, 't': 1, 'k': 1})