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.
思路
本题要求就是在给定的字符串中找回文数,就是从中间对称的串,并且是可以移动字母的,即统计偶数对字符对数就可以了。
最后判断偶数对*2是否等于字符串长度,从而判断是否可以添加字符在偶数对的中间。
统计偶数对字符串:使用unordered_map
class Solution {
public:
int longestPalindrome(string s) {
unordered_map<char,int>m;
//统计所有字符的个数
for(int i=0;i<s.size();i++){
m[s[i]]++;
}
int count=0;
//统计偶数对
unordered_map<char,int>::iterator it;
for(it = m.begin();it!=m.end();it++){
if(it->second>=2){
count+=it->second/2;
}
}
if(count*2==s.size()){
return count*2;
}else{
return count*2+1;
}
}
};