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

思路：

首先统计每个字母出现的次数，然后计算可以构成的回文字符串的最大长度：对于出现偶数次数的字符，它全部可以用来构造回文字符串；对于出现奇数次数的字符，只有其中一个字符可全部参与回文字符串的构造，其它出现奇数次的字符都会剩一个字符，不能够参与回文字符串的构造。下文算法的时间复杂度是O(n)，空间复杂度也是O(n)，其中n是字符串的长度。

代码：

class Solution {
public:
    int longestPalindrome(string s) {
        unordered_map<char, int> hash;
        for(int i = 0; i < s.length(); ++i) {
            ++hash[s[i]];
        }
        int ret = 0;
        bool has_odd = false;
        for(auto it = hash.begin(); it != hash.end(); ++it) {
            if(it->second % 2 != 0) {
                has_odd = true;
                ret += it->second - 1;
            }
            else {
                ret += it->second;
            }
        }
        if(has_odd) {
            ++ret;
        }
        return ret;
    }
};