409. Longest Palindrome

Given a string which consistsof lowercase or uppercase letters, find the length of the longest palindromesthat can be built with those letters.

 This is case sensitive, forexample "Aa" is not considered a palindrome here.

 Note:

Assume the length of givenstring will not exceed 1,010.

    翻译：给定一个由小写或大写字母组成的字符串，找到可以用这些字母构建的最长回文的长度。这是区分大小写的，例如“Aa”在这里不被视为回文。

    注意：假设给定字符串的长度不超过1,010。例如：“abbccdda”输出8

    题目不难，实际上就是让你找出凑成回文数的规律。可以看出字母为双数的个数，若长度和字符串不等，则长度加一。具体代码如下：

public class Solution {

    public int longestPalindrome(String s) {

        int a[]=new int[123];

           for(int i=0;i<s.length();i++){

                 a[s.charAt(i)]++;

           }

           int count=0;

           for(int i=0;i<a.length;i++){

                 if(a[i]>1){

                      count+=a[i]%2==0 ?a[i]:a[i]-1;

                 }

                

           }

           if(count!=s.length())                

                 count+=1; 

           return count;

    }

}