409. Longest Palindrome

题目摘要
给定一个由大小写字符组成的字符串，找出用该字符串里的字符能组成的最长的回文的长度。注意大小写敏感。

解法
先遍历字符串，统计各个大小写字母的出现频率，分别保存到两个长度为26的数组里，再统计回文长度（频率 / 2 * 2以将奇数频率减一，如果算出长度不等于字符串长度，最后结果再加一，中间可以是奇数）。

public class Solution {
    public int longestPalindrome(String s) {
        if (s == null || s.length() == 0) return 0;
        int[] lowercase = new int[26];
        int[] uppercase = new int[26];
        char[] ch = s.toCharArray();
        for (char c : ch) {
            if (c - 'a' >= 0) lowercase[c - 'a']++;
            else uppercase[c - 'A']++;
        }
        int result = 0;
        for (int i = 0; i < 26; i++) {
            result += lowercase[i] / 2 * 2;
            result += uppercase[i] / 2 * 2;
        }
        return result == s.length() ? result : result + 1;
    }
}

注意

可问问题

• 大小写敏感吗？

原题

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”

7

Explanation: One longest palindrome that can be built is “dccaccd”,
whose length is 7.