力扣409. 最长回文串

原题链接

class Solution:
    def longestPalindrome(self, s: str) -> int:
        dic = {}
        ans = bonus = 0
        for c in s:
            if c in dic:
                dic[c] += 1
            else:
                dic[c] = 1
        for value in dic.values():
            ans += value // 2 * 2
            if value & 1 == 1:bonus = 1
        return ans + bonus