409. 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

解题思路：

利用哈希表存储每个字母出现的次数；然后遍历哈希表，如果是偶数则直接相加，如果是奇数则减1再加；最后如果哈希表中有奇数，最后结果需要++

Java-Solution

public class Solution {
    public int longestPalindrome(String s) {
        int size = s.length();
        if(size == 0)   return 0;
        if(size == 1)   return 1;
        int[] fre = new int[52];
        for(int i = 0; i < size; i++){
            char temp = s.charAt(i);
            if(temp >= 'a' && temp <= 'z'){
                fre[temp - 'G']++;
            }
            if(temp >= 'A' && temp <= 'Z'){
                fre[temp - 'A']++;
            }
        }
        int result = 0;
        boolean hasOdd = false;
        for(int i = 0; i < 52; i++){
            if(isOdd(fre[i])){
                result += fre[i] - 1;
                hasOdd = true;
            }
            else{
                result += fre[i];
            }
        }
        if(hasOdd){
            return ++result;
        }
        return result;
    }

    private boolean isOdd(int num){
        double divD = num / 2.0;
        int divI = num / 2;
        if(divD - divI == 0){
            return false;
        }
        return true;
    }
}