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.
public class Solution {
public int longestPalindrome(String s) {
int[] tmp = new int[128];
int result =0;
for(int i=0;i<s.length();i++){
tmp[s.charAt(i) - 'A']++;
if(tmp[s.charAt(i) - 'A'] ==2){
tmp[s.charAt(i) - 'A'] =0;
result +=2;
}
}
if(result < s.length()){
return result+1;
}
else{
return result;
}
}
}
本站原创文章皆遵循“署名-非商业性使用-相同方式共享 3.0 (CC BY-NC-SA 3.0)”。转载请保留以下标注：
