[leetcode]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.

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.

分析：

从所给字母中判断能组成最长回文串的长度，区分大小写字母。回文字符串要么是左右完全对称，如“abba”，要么是以中心为界左右对称，如“aba”。因此只要统计所有字母出现的最大偶数次数的总和再加1即可，可以先统计每个字符出现的次数，把每个出现奇数次的字符-1，剩下的就是所求的长度。可以按位与1来判断是奇数还是偶数，若为奇数，则odds+1，最后用字符长度-odds+1即可。

class Solution {
public:
    int longestPalindrome(string s) {
        int odds = 0;//字母出现次数为奇数的个数
        int num = 0;
        for(char c='A'; c<='z'; c++)
        {
            num = count(s.begin(),s.end(),c);//计算s中字符c的个数
            odds += num & 1;//按位与1，奇数为1，偶数为0
        }
        return s.size() - max(0 , odds-1);
    }
};