Leetcode409. Longest Palindrome

一、题目

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.

二、思路

求字符串中最大的回文长度
 *思路：统计字符串中每个字母出现的次数，出现偶数次的直接相加，奇数次-1相加，最后再加一即可

三、代码

public class Solution {
    public int longestPalindrome(String s) {
        int rs=0;
int odd=0;
//很据字符编码将数组长度设置为58
int []a=new int[58];
char[]s1=s.toCharArray();
//统计各个字符出现的长度
for(int i=0;i<s.length();i++){
a[s1[i]-'A']++;
}
//偶数个直接相加，奇数个-1再相加；如果有奇数，最后再加一，作为最中间的数值，如果没有奇数个，则不加1
for(int j=0;j<58;j++){
if(a[j]%2==0)
rs=rs+a[j];
else {
rs=rs+a[j]-1;
odd=1;
}
}
return rs+odd;
    }
}

原题地址