leetcode算法题----Longest Palindrome最长回文

题目：

409. Longest Palindrome最长回文

Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.

给定一个字符串，包含大写和小写字母。从中取出字母生成字符串，问能生成的回文字符子串的最大长度是多少。

This is case sensitive, for example "Aa" is not considered a palindrome here.

注意：A和a是不同的。

Note:
Assume the length of given string will not exceed 1,010.

Example:

Input:
"abccccdd"

Output:
7

Explanation:
One longest palindrome that can be built is "dccaccd", whose length is 7.

解决思路：用counter统计每个字母出现的次数。

偶数的次数，次数直接加

奇数的次数，次数-1

如果有次数为1的，加1

把上面3个的加到一起

python代码：

#from collections import Counter
class Solution(object):
    def longestPalindrome(self, s):
        """
        :type s: str
        :rtype: int
        """
        dict = collections.Counter(s)
        sum = 0
        for item in dict:
            number = dict[item]
            double = number if number % 2 == 0 else number - 1
            dict[item] -= double
            sum += double
        print dict
        if 1 in dict.values():
            sum += 1
        return sum

参考：

LeetCode#409 Longest Palindrome   https://www.jianshu.com/p/6c7ad4e07999