1,题目要求:
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,题目思路:
只要某一个字符出现的次数为偶数次,则一定可以在回文串中的,而回文串中也可以有一个其他的字母。
因此题目只需要统计一个字符串中出现的奇数次的字母的个数即可。
3,程序源码:
#include <iostream>
#include <string.h>
using namespace std;
class Solution {
public:
int longestPalindrome(string s) {
int odds = 0;
for (char c='A'; c<='z'; c++)
//odds += count(s.begin(), s.end(), c) & 1;//奇数与1进行&得到的为1,偶数为0,是个很好的判断奇偶的办法。
if (count(s.begin(), s.end(), c) %2 != 0)
odds ++;
if (odds > 0)
return s.size() - odds +1 ;
else
return s.size() -odds;
//return s.size() - odds + (odds > 0);
}
};
int main() {
Solution Sol;
cout<<Sol.longestPalindrome("abbc")<<endl;
return 0;
}