409.leetcode Longest Palindrome(easy)[字符串处理 最长回文]

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.

这道题要利用当前已有的字符组成最长的回文串，那么思路是首先统计各个字母的个数，偶数个数的字母都可以平分为回文串的部分，而奇数个数的字母的偶数部分也可以，最后如果有奇数个数的字符，除去已经成为回文的部分，随便选择一个加入为中间部分。

class Solution {
public:
    int longestPalindrome(string s) {
        int n= s.length();
        if(n <= 1) return n;
        map<char,int> status;
        for(int i=0;i<n;i++)
            status[s[i]]++;
        bool hasodd = false;
        int sum = 0;
        map<char,int>::iterator iter = status.begin();
        for(;iter != status.end();++iter)
        {
            int temp = iter->second;
            if(temp%2 != 0)
                 hasodd = true;
            sum += temp>>1;
        }
        sum *= 2;
        if(hasodd)
            sum++;
        return sum;
    }
};