用法
用collections.Counter来快速统计元素个数:
import collections
a = collections.Counter("sdfdsgsdfdfssfd") #把所有元素出现的次数统计下来了
print(a)
输出结果:
Counter({‘s’: 5, ‘d’: 5, ‘f’: 4, ‘g’: 1})
具体案例
Leetcode 409. 最长回文串 可用collections.Counter来快速解题。(https://leetcode-cn.com/problems/longest-palindrome/)
备注:本题的另一个关键在于对回文串的构造,对于奇数要特殊处理
class Solution:
def longestPalindrome(self, s: str) -> int:
import collections
cal = collections.Counter(s)
res, has_odd = 0, False
for key, value in cal.items():
if value % 2 == 0:
res += value
else:
res += value - 1
has_odd = True
return res+1 if has_odd else res