leetcode-409 最长回文串 Python

方法一：利用hashmap

class Solution:
    def longestPalindrome(self, s: str) -> int:
        ans = 0
        count = collections.Counter(s)
        for v in count.values():
            ans += v//2 * 2
            if ans % 2 == 0 and v % 2 == 1:
                ans += 1
        return ans