leetcode刷题之 字符串(5): 计算一组字符集合可以组成的回文字符串的最大长度

[LeetCode] 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.

class Solution {
    public int longestPalindrome(String s) {
        int[] ret = new int[256];
        for(char c : s.toCharArray()){
            ret[c]++;
        }
        int len = 0;
        for(int i=0; i<ret.length; i++){
            len += (ret[i] / 2) * 2;//一定要这么写 因为里面包含
偶数个 奇数个（大于等于3个情况）
        }
        if(len < s.length() )//如果最后结果比较小原始字符串小说明一定存在奇数个的字符 拿一个过来用
            len++;
        return len;
            
    }
    
}