LongestPalindrome.java

class LongestPalindrome {
    public int longestPalindrome(String s) {
        int[] count = new int[128];
        for (char c : s.toCharArray()) {
            count[c]++;
        }
        int odds = 0;
        for (char c = 'A'; c <= 'z'; c++) {
            if (count[c] % 2 == 1) {
                odds++;
            }
        }
        return odds > 1 ? s.length() - odds + 1: s.length();
    }
}