LeetCode-409. Longest Palindrome [C++][Java]_explanation the longest palindrome is "ava". topco-CSDN博客

本文链接：https://blog.csdn.net/qq_15711195/article/details/126114104

该博客介绍了如何利用C++和Java的哈希表来解决LeetCode上的409题——最长回文串。通过计算每个字符出现的次数，确定可以构建的最长回文串长度。文章详细解释了代码逻辑，并提供了两种语言的实现方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

LeetCode-409. Longest PalindromeLevel up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/longest-palindrome/

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
Explanation: The longest palindrome that can be built is "a", whose length is 1.

Constraints:

1 <= s.length <= 2000
s consists of lowercase and/or uppercase English letters only.

【C++】

class Solution {
public:
    int longestPalindrome(string s) {
        unordered_map<char, int> dict;
        for (auto x : s) {dict[x] += 1;}
        int length = 0, one_count = 0 ;
        for (auto it = dict.begin(); it != dict.end(); it++) {
            if (it->second % 2 == 0) {length += it->second;}
            else {
                if (it->second != 1) {length = length +(it->second-1);}
                ++one_count;
            }
        }
        if (one_count > 0) {return length + 1;}
        return length;
    }
};

【Java】

class Solution {
    public int longestPalindrome(String s) {
        Map<Character, Integer> dict = new HashMap<>();
        for (char ch : s.toCharArray()) {dict.put(ch, dict.getOrDefault(ch, 0) + 1);}
        int length = 0, oneCount = 0;
        for (Character ch : dict.keySet()) {
            int cnt = dict.get(ch);
            if (cnt % 2 == 0) {length += cnt;}
            else {
                if (cnt > 1) {length += cnt - 1;}
                oneCount++;
            }
        }
        if (oneCount > 0) {return length + 1;}
        return length;
    }
}