409. Longest Palindrome （C++）

题目：

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，在最后提交答案时根据是否有奇数看是否加1
int longestPalindrome(string s) {
    //vector<int> count(58, 0);
    int count[256] = { 0 };
    int sum = 0,one=0;
    int len = s.length();
    for (int i = 0; i < len; i++)
        //count[s[i] - 'A'] ++;
        count[s[i]] ++;
    //for (int j = 0; j < 58; j++)
    for (int j = 0; j < 256; j++)
    {
        if (count[j] % 2 == 0)
            sum += count[j];
        else// if (count[j] >= max)
        {
            //max = count[j];
            sum += (count[j] - 1);
            one = 1;
        }
    }
    return sum + one;
}//(3ms)

依然是各种不细心，题目理解不正确
以后要思考思考自己是否把可能的问题都问完了