409. Longest Palindrome

JIAKAOBO

LeetCode

感谢赞助!

• ㊗️
• 大家
• offer
• 多多！

Problem

Given a string s which consists of lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters.

Letters are case sensitive, for example, “Aa” is not considered a palindrome here.

Example 1:

Input: s = "abccccdd"
Output: 7
Explanation:
One longest palindrome that can be built is "dccaccd", whose length is 7.

Example 2:

Input: s = "a"
Output: 1

Example 3:

Input: s = "bb"
Output: 2

Code

class Solution{
    public int longestPalindrome(String s){
        int[] count = new int[128];
        for(char c : s.toCharArray()){
            count[c]++;
        }

        int res = 0;
        for(int c : count){
            res += c / 2 * 2;
            if(res % 2 == 0 && c % 2 == 1){
                res++;
            }
        }

        return res;
    }
}