LeetCode : 409. Longest Palindrome 最长回文

最新推荐文章于 2024-11-10 15:41:12 发布

青盏

最新推荐文章于 2024-11-10 15:41:12 发布

阅读量104

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/qq_16234613/article/details/89390922

LeetCode 专栏收录该内容

154 篇文章

订阅专栏

本文介绍了一种算法，用于从给定的字符串中构建最长的回文子串。该算法考虑了大小写敏感性，并通过实例展示了如何在长度不超过1,010的字符串中找到最长的回文子串。

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

试题：
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[] count = new int[256];
        for(char c : s.toCharArray()){
            count[c] ++;
        }
        int len=0;
        for(int c : count){
            len += c/2*2;
        }
        if(len<s.length()) len++;
        return len;
    }
}