Leetcode 409. Longest palindrome

Problem-solving ideas: A single AC, the number of occurrences of each character in the string, an even number of direct accumulation, odd number of repetitions of the sum, the final return value needs to be noted, with odd characters, the returned result is count+1, if only the even character, the direct return count.

Class Solution {public
:
    int longestpalindrome (string s) {
        map<char,int>res;
        for (int i = 0; i < s.length (); i++) {
            res[s[i]]++;
        }
        int count = 0;
        BOOL flag = 0;
        Map<char,int>::iterator it;
        for (it = Res.begin (); It! = Res.end (); it++) {
            if (it->second% 2 = = 0)
                count + = it->second;
            else{
                Count + = (it->second-1);
                Flag  = 1;
            }
        }
        if (flag = = 1)
        return count +1;
        else
        return count;
        
    }
};