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.
思路:
回文:把字符串前后颠倒字符串不变,即字符串是对称的。要想使得构造的字符串对称,除了字符串正中间的字符,其他字符都必须成对出现。
实现一:
借助unordered_map统计字符串中每个字符出现的次数。
Code:
class Solution {
public:
int longestPalindrome(string s) {
int ans=0;
unordered_map<char,int> charNumMap;
for(int i=0;i<s.size();i++){
charNumMap[s[i]]++;
}
for(int i=0; i<charNumMap.size();i++){
ans +=charNumMap[i]/2*2;
}
if(ans<s.size()) ans++;
return ans;
}
};
实现二:
将每个字符出现的次数&1(只保留偶数个)。最后加1个其他任意字符作为回文的中间字符。
Code:
int longestPalindrome(string s) {
int odds = 0;
for (char c='A'; c<='z'; c++)
odds += count(s.begin(), s.end(), c) & 1;
return s.size() - odds + (odds > 0);
}