思路(用到字典)
统计每个字符串的次数,偶次数全部加上,奇数的加上最大的偶数,然后在根据是否需要加一。
代码
class Solution(object):
def longestPalindrome(self, s):
"""
:type s: str
:rtype: int
"""
import collections
dic = collections.Counter(s)
lenght = 0
maxnums = 0
for i in dic.values():
if i %2 == 0:
lenght += i
else:
lenght += i-1
maxnums = 1
return lenght+maxnums