409. Longest Palindrome

409. Longest Palindrom

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.

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.

分析：字符串是偶数，一定可以。只有一个奇数个字符串要放在中间，其它若是奇数，只能是-1个。

int longestPalindrome(string s) {
       
        int sum=s.size();
        vector
    
    
     
      hash(52);//用来存储频率
        for(char c:s)
         {
             if(c<='z'&&c>='a')
             hash[c-'a']++;
             else hash[(c-'A')+26]++;
         }
        int count=0;
        for(auto it:hash)
        {
            if(it%2)
            count++;//奇数个
        }
        
        return count>0?sum-count+1:sum;
    }